Abstract
This paper describes a new approach to the generation of good solutions to the TSP using evolution programs. A novel genetic crossover operator is introduced, which generates a single offspring without explicitly preserving particular characteristics like position, order or adjacency. A geometrical explanation of the heuristic lies on the fact that a good TSP tour does not have crossing edges (or knots). The crossover technique aims to untie the knots and consequently, the evolutionary search is executed over populations of lesser knotted solutions. This operator, that we have called knot-cracker, always produces legal offspring’s avoiding repairing techniques. Experiments were performed over the same benchmarks used by the authors of the Enhanced Edge Recombination operator (EER) in their seminal publication. An enhanced version of the knot-cracker is also proposed, which improves previous results, reaches high quality solutions with high consistency and shows a better performance than the EER.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Jog, J. Y. Suh and D. Van Gucht, The Effects of Population Size, Heuristic Crossover and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem. In Proc. of the Third International Conference on Genetic Algorithms. J. D. Schaffer editor. Morgan Kauffmann Publishers. Los Altos. CA, 1989.
F. P. MarÍn, A new monitoring parameter for the traveling salesman problem. Phys. Rev. Lett. 77, 5149, 1996.
Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs. Second edition. Springer-Verlag, Berlin, 1994.
T. Starkweather, S. McDaniel, K. Mathias, D. Whitley and C. Whitley, A Comparison of Genetic Sequencing Operators. In Proc. of the Fourth International Conference on Genetic Algorithms. R. K. Belew and L. B. Booker editors. Morgan Kauffmann Publishers. Los Altos. CA, 1991.
D. Whitley, T. Starkweather and D’A. Fuquay, Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator. In Proc. of the Third International Conference on Genetic Algorithms. J. D. Schaffer editor. Morgan Kauffmann Publishers. Los Altos. CA, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carrasquero, N., Moreno, J.A. (1998). A New Genetic Operator for the Traveling Salesman Problem. In: Coelho, H. (eds) Progress in Artificial Intelligence — IBERAMIA 98. IBERAMIA 1998. Lecture Notes in Computer Science(), vol 1484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49795-1_28
Download citation
DOI: https://doi.org/10.1007/3-540-49795-1_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64992-2
Online ISBN: 978-3-540-49795-0
eBook Packages: Springer Book Archive