A speed-up for Helsgaun’s TSP heuristic by relaxing the positive gain criterion
- 9 March 2026
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 191
Abstract
No abstract availableAll Related Versions
Funding Information
- Bundesministerium für Wirtschaft und Klimaschutz
- Deutsche Forschungsgemeinschaft (EXC 2163/1)
- Deutsche Forschungsgemeinschaft (390881007)
This publication has 27 references indexed in Scilit:
- Improving Ant Colony Optimization efficiency for solving large TSP instancesApplied Soft Computing, 2022
- Hard to solve instances of the Euclidean Traveling Salesman ProblemMathematical Programming Computation, 2020
- Efficiently solving very large-scale routing problemsComputers & Operations Research, 2019
- GLNS: An effective large neighborhood search heuristic for the Generalized Traveling Salesman ProblemComputers & Operations Research, 2017
- Solving the equality generalized traveling salesman problem using the Lin–Kernighan–Helsgaun AlgorithmMathematical Programming Computation, 2015
- A backbone based TSP heuristic for large instancesJournal of Heuristics, 2013
- General k-opt submoves for the Lin–Kernighan TSP heuristicMathematical Programming Computation, 2009
- Large-step markov chains for the TSP incorporating local search heuristicsOperations Research Letters, 1992
- Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithmJournal of Optimization Theory and Applications, 1985
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965