The team orienteering problem with variable time windows
International Transactions in Operational Research, Volume 33, Issue 3, Page 1705-1732, May 2026.Abstract The orienteering problem is well‐established within the domain of operational research. This paper introduces the team orienteering problem with variable time windows (TOPVTW) as a new variant of the team orienteering problem with time windows. The distinguishing feature of the TOPVTW is the adaptive time windows, which evolve dynamically as a
Bibiana Granda, Begoña Vitoriano
wiley +1 more source
Penentuan Rute Distribusi Teh Botol Menggunakan Metode Traveling Salesman Problem (Tsp) Untuk Minimasi Biaya Distribusi [PDF]
, 2014 PT. Sinar Sosro merupakan salah satu Perusahaan yang bergerak dalam produk minuman yang terletak di Jl. Cangkir KM 21 Driyorejo Gresik, ada pun macam-macam produknya seperti Teh Botol, Fruit Tea, Cuntry Choice, Tebs dll.
& Sumiati, Fahmi Fuadi Al Akbar
core
Elitist Ant System with 2-opt Local Search for the Traveling Salesman Problem
Advances in Electrical and Computer Engineering, 2012 The Traveling Salesman Problem is one of the most famous problems in combinatorial optimization. The paper presents an algorithm based upon the elitist ant system for solving the traveling salesman problem.
MARTINOVIC, G., BAJER, D.
doaj +1 more source
Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons
, 2013 We give a short proof that any comparison-based n^(1-epsilon)-approximation algorithm for the 1-dimensional Traveling Salesman Problem (TSP) requires Omega(n log n) comparisons.Comment: Superseded by "On the complexity of approximating Euclidean ...
Young, Neal E.
core
Fluctuations in the Site Disordered Traveling Salesman Problem
, 2007 We extend a previous statistical mechanical treatment of the traveling salesman problem by defining a discrete "site disordered'' problem in which fluctuations about saddle points can be computed.
Barvinok A +15 more
core +2 more sources
On random symmetric travelling salesman problems [PDF]
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003 Let the edges of the complete graph Kn be assigned independent uniform [0, 1] random edge weights. Let ZTSP and Z2FAC be the weights of the minimum length travelling salesman tour and minimum weight 2-factor, respectively. We show that whp |ZTSP − Z2FAC| = o(1).
openaire +1 more source
The Maximum Traveling Salesman Problem with Submodular Rewards [PDF]
, 2012 In this paper, we look at the problem of finding the tour of maximum reward on an undirected graph where the reward is a submodular function, that has a curvature of $\kappa$, of the edges in the tour. This problem is known to be NP-hard.
Jawaid Stephen, L. Smith, Syed Talha
core
New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP) [PDF]
Journal of Optimization in Industrial Engineering, 2010 Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution.
Ellips Masehian
doaj
Dataset for the electric capacitated traveling salesman problem. [PDF]
Data Brief, 2023 Gialos A, Zeimpekis V.
europepmc +1 more source
Traveling salesman problem solution using magnonic combinatorial device. [PDF]
Sci Rep, 2023 Balinskyy M, Khitun A.
europepmc +1 more source