Results 31 to 40 of about 72,966 (206)
Traveling salesman problem parallelization by solving clustered subproblems
Foundations of Computing and Decision Sciences, 2023 A method of parallelizing the process of solving the traveling salesman problem is suggested, where the solver is a heuristic algorithm. The traveling salesman problem parallelization is fulfilled by clustering the nodes into a given number of groups ...
Romanuke Vadim
doaj +1 more source
A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems
International Journal of Computational Intelligence Systems, 2018 Multiple Traveling Salesman Problem (MTSP) is able to model and solve various real-life applications such as multiple scheduling, multiple vehicle routing and multiple path planning problems, etc.
Kin-Ming Lo +5 more
doaj +1 more source
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
, 2008 We give a 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem.Comment: 6 ...
A. Barvinok +15 more
core +1 more source
Traveling salesman games [PDF]
Mathematical Programming, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Potters, J.A.M., Curiel, I., Tijs, S.H.
openaire +6 more sources
Approximating ATSP by Relaxing Connectivity
, 2015 The standard LP relaxation of the asymmetric traveling salesman problem has been conjectured to have a constant integrality gap in the metric case. We prove this conjecture when restricted to shortest path metrics of node-weighted digraphs. Our arguments
Svensson, Ola
core +1 more source
The Attractive Traveling Salesman Problem [PDF]
European Journal of Operational Research, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erdogan, Gunes +2 more
openaire +2 more sources
A Multi-Phase Method for Euclidean Traveling Salesman Problems
Axioms, 2022 The Traveling Salesman Problem (TSP) aims to find the shortest tour for a salesman who starts and ends in the same city and visits the remaining n−1 cities exactly once.
Víctor Hugo Pacheco-Valencia +3 more
doaj +1 more source
Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution
, 2006 We report a new statistical general property in traveling salesman problem, that the $n$th-nearest-neighbor distribution of optimal tours verifies with very high accuracy an exponential decay as a function of the order of neighbor $n$.
Brooke +21 more
core +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT This study demonstrates how a profitable, lean, and environmentally responsible e‐waste reverse logistics system can be designed using integrated Operations Research (OR) techniques. Addressing the growing urgency of responsible consumption (UN SDG 12) and the projected rise of the e‐waste sector to USD 137.60 billion by 2029, the research ...
Sheeba Pathak, Hajar Fatorachian
wiley +1 more source
On the Solution of the Traveling Salesman Problem by a Modification of the Hungarian Method
Кібернетика та комп'ютерні технологіїIntroduction. The traveling salesman problem is becoming an important object of research in various fields of science, economics and technology. Construction of efficient algorithms with an optimality criterion for the obtained solution is a relevant ...
Dmitri Terzi
doaj +1 more source