Guided local search and its application to the traveling salesman problem
- 1 March 1999
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 113 (2) , 469-499
- https://doi.org/10.1016/s0377-2217(98)00099-x
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSPINFORMS Journal on Computing, 1996
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- Fast Algorithms for Geometric Traveling Salesman ProblemsINFORMS Journal on Computing, 1992
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number PartitioningOperations Research, 1991
- An improved annealing scheme for the QAPEuropean Journal of Operational Research, 1990
- Tabu Search—Part IIINFORMS Journal on Computing, 1990
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOperations Research, 1989
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 1986
- A Method for Solving Traveling-Salesman ProblemsOperations Research, 1958