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
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
Dynamic sub-route-based self-adaptive beam search Q-learning algorithm for traveling salesman problem. [PDF]
PLoS One, 2023 Zhang J, Liu Q, Han X.
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
Evaluating quantum-classical heuristics for traveling salesman problem
Discrete and Continuous Models and Applied Computational ScienceIn this paper, we develop and evaluate a hybrid quantum-classical heuristic approach to solving the Traveling Salesman Problem. This approach uses exhaustive enumeration of the starting paths and optimizes the remainder of the route using quantum ...
Mariia A. Makarova +4 more
doaj +1 more source
Solving optimization problems simultaneously: the variants of the traveling salesman problem with time windows using multifactorial evolutionary algorithm. [PDF]
PeerJ Comput Sci, 2023 Ban HB, Pham DH.
europepmc +1 more source
Iterative Patching and the Asymmetric Traveling Salesman Problem [PDF]
Although Branch and Bound (BnB) methods are among the most widely used techniques for solving hard problems, it is still a challenge to make these methods smarter.
Ghosh, Diptesh +3 more
core +1 more source