On the Core of Multiple Longest Traveling Salesman Games [PDF]
In this paper we introduce multiple longest traveling salesman (MLTS) games. An MLTS game arises from a network in which a salesman has to visit each node (player) precisely once, except its home location, in an order that maximizes the total reward ...
Borm, P.E.M. +2 more
core +1 more source
Traveling salesman problem solution using magnonic combinatorial device. [PDF]
Sci Rep, 2023 Balinskyy M, Khitun A.
europepmc +1 more source
The using of solver software and vehicle routing for the traveling salesman problem [PDF]
, 2014 The traveling salesman problem (TSP) is one of the most studied problems in management science. Optimal approaches to solving traveling salesman problems are based on mathematical programming.
Dzidrov, Misko +5 more
core
Heuristics and Learning Models for Dubins MinMax Traveling Salesman Problem. [PDF]
Sensors (Basel), 2023 Nayak A, Rathinam S.
europepmc +1 more source
Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem. [PDF]
Entropy (Basel), 2023 Qian W +5 more
europepmc +1 more source
The Application of Ant Colony Algorithm in Solve the Traveling Salesman Problem with Fuzzy Movement Time among Cities [PDF]
Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī, 2010 Traveling salesman problem (TSP) is one of the most well-known combinational optimization problems which recently has been a suitable base to validate different heuristic and Meta heuristic algorithms.
Jamshid Salehi Sadaghiani
doaj
A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model. [PDF]
Comput Intell Neurosci, 2022 Wang Z, Wu X, Wu T.
europepmc +1 more source
Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the Traveling Salesman Problem (TSP). [PDF]
PeerJ Comput Sci, 2023 Hao T, Yingnian W, Jiaxing Z, Jing Z.
europepmc +1 more source
Combinatorial relaxation of the k-traveling salesman problem
, 2016 The k-traveling salesman problem, or k-TSP is: given a graph with edge weights and an integer k, find a simple cycle of minimum weight visiting exactly k nodes. To obtain lower bounds for the traveling salesman problem the 2-matching relaxation and the 1-
Horbach, Andrei
core
Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm. [PDF]
Comput Intell Neurosci, 2022 Liu G, Xu X, Wang F, Tang Y.
europepmc +1 more source