Abstract
This paper presents a new tabu search approach for the geometric Traveling Salesman Problem. The use of complex TSP transitions in a tabu search context is investigated; among these transitions are the classical Lin-Kernighan transition and a new transition, called the Flower transition. The neighbourhood of the complex transitions is reduced strategically by using computational geometry forming a so-called variable candidate set of neighbouring solutions, the average quality of which controlled by a parameter. A new diversification method based on a notion of solution-distance is used. The experimental results are comparable to the best published results in the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. L. Bentley, Fast Algorithms for Geometric Traveling Salesman Problems. ORSA Journal on Computing 4(4), 387–411, 1992.
C.-N. Fiechter, A parallel tabu search algorithm for large traveling salesman problems. Discrete Applied Mathematics 51, 243–267, 1994.
F. Glover, Tabu Search — Part I. ORSA Journal on Computing 1(3), 190–206, 1989.
F. Glover, Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems. Technical report, Graduate School of Business, University of Colorado, Boulder, 1992.
F. Glover and M. Laguna, Tabu Search in: Modern Heuristic Techniques for Combinatorial Problems, ed. CR. Reeves (Blackwell, Oxford, 1993).
D. S. Johnson, Local Optimization and the Traveling Salesman Problem. Proc. Seventeenth Colloquium on Automata, Languages and Programming, Springer-Verlag, 446–461, 1990.
S. Lin and B. W. Kernighan, An Effective Heuristic Algorithm for the Traveling-Salesman Problem. Operations Research 21, 498–516, 1973.
M. Malek, M. Guruswamy, M. Pandya and H. Owens, Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem. Annals of Operations Research 21, 59–84, 1989.
O. Martin, S. W. Otto and E. W. Feiten, Large-step Markov chains for TSP incorporating local search heuristics. Operations Research Letters 11(4), 219–224, 1992.
G. Reinelt, TSPLIB - A Traveling Salesman Problem Library. ORSA Journal on Computing 3(4), 376–384, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Zachariasen, M., Dam, M. (1996). Tabu Search on the Geometric Traveling Salesman Problem. In: Osman, I.H., Kelly, J.P. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1361-8_34
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1361-8_34
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8587-8
Online ISBN: 978-1-4613-1361-8
eBook Packages: Springer Book Archive