Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- 1 December 1989
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 21 (1) , 59-84
- https://doi.org/10.1007/bf02022093
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Optimization of a 532-city symmetric traveling salesman problem by branch and cutOperations Research Letters, 1987
- Optimization by Simulated AnnealingScience, 1983
- The traveling salesman problem: An update of researchNaval Research Logistics Quarterly, 1983
- A man-machine approach toward solving the traveling salesman problemCommunications of the ACM, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969
- A Heuristic Approach to Solving Travelling Salesman ProblemsManagement Science, 1964