Abstract
Optimal results for the Traveling Salesrep Problem have been reported on problems with up to 3038 cities using a GA with Edge Assembly Crossover (EAX). This paper first attempts to independently replicate these results on Padberg's 532 city problem. We then evaluate the performance contribution of the various algorithm components. The incorporation of 2-opt into the EAX GA is also explored. Finally, comparative results are presented for a population-based form of 2-opt that uses partial restarts.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Boese. Cost versus distance in the traveling salesman problem. Technical report, Computer Science Department, Univeristy of California, Los Angeles, 1995.
Larry Eshelman. The CHC Adaptive Search Algorithm. How to Have Safe Search When Engaging in Nontraditional Genetic Recombination. In G. Rawlins, editor, FOGA-1, pages 265–283. Morgan Kaufmann, 1991.
Bernd Freisleben and Peter Merz. New genetic local search operators for the traveling salesman problem. In H.M. Voigt, W. Ebeling, Ingo Rechenberg, and H.P. Schwefel, editors, Parallel Problem Solving from Nature, 4, pages 890–899. Springer/Verlag, 1996.
Martina Gorges-Schleuter. ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy. In J.D. Schaffer, editor, Proc. of the 3rd Int'l. Conf. on GAs, pages 422–433. Morgan Kaufmann, 1989.
Keith E. Mathias and L. Darrell Whitley. Genetic Operators, the Fitness Landscape and the Traveling Salesman Problem. In R. Männer and B. Manderick, editors, Parallel Problem Solving from Nature, 2, pages 219–228. Elsevier Science Publishers, 1992.
H. Mühlenbein. Evolution in Time and Space: The Parallel Genetic Algorithm. In G. Rawlins, editor, FOGA-1, pages 316–337. Morgan Kaufmann, 1991.
Yuichi Nagata and Shigenobu Kobayashi. Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem. In T. Bäck, editor, Proc. of the 7th Int'l. Conf. on GAs, pages 450–457. Morgan Kaufmann, 1997.
W. Padberg and G. Rinaldi. Optimization of a 532 City Symmetric TSP. Optimization Research Letters, 6(1):1–7, 1987.
Nicholas J. Radcliffe. The algebra of genetic algorithms. Annals of Maths and Artificial Intelligence, 10:339–384, 1994.
N.J. Radcliffe and P.D. Surry. Fitness variance of formae and performance predictions. In D. Whitley and M. Vose, editors, FOGA — 3, pages 51–72. Morgan Kaufmann, 1995.
Darrell Whitley and Joan Kauth. GENITOR: A Different Genetic Algorithm. In Proceedings of the 1988 Rocky Mountain Conference on Artificial Intelligence, 1988.
Darrell Whitley, Timothy Starkweather, and D'ann Fuquay. Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator. In J. D. Schaffer, editor, Proc. of the 3rd Int'l. Conf. on GAs. Morgan Kaufmann, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Watson, J. et al. (1998). The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056924
Download citation
DOI: https://doi.org/10.1007/BFb0056924
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65078-2
Online ISBN: 978-3-540-49672-4
eBook Packages: Springer Book Archive