Abstract
Genetic Algorithms (GAs) have traditionally been designed to work on bitstrings. More recently interest has shifted to the application of GAs to constraint optimization and combinatorial optimization problems. Important for an effective and efficient search is the use of a suitable crossover operator. This paper analyses the performance of six existing crossover operators in the traveling salesman domain. While the edge recombination operator was reported to be the most suitable operator in the TSP domain, our results suggest that this is only true for symmetric TSPs. The problem with edge recombination is that it inverts edges found in the parents. This has no negative effect for the symmetric TSP but can have a substantial effect if the TSP is asymmetric. We propose an edge based crossover operator for the asymmetric TSP and demonstrate its superiority over the traditional edge recombination. Another interesting finding is that order crossover (OX) which has an average performance for symmetric problems, performs very well on asymmetric problems.
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
Bäck T., Evolutionary Algorithms in Theory and Practice, New York, Oxford University Press, 1995.
Bäck T., D.B. Fogel, and Z. Michalewicz, Eds., Handbook of Evolutionary Computation, New York, Oxford University Press and Institute of Physics, 1997.
Darrah S., “Bus Routing Problem with Time Windows Using Genetic Algorithms,” CS420 Project Report, University of Regina, Dept. of Computer Science, Regina, Canada, 1999.
Davis, L., “Job Shop Scheduling with Genetic Algorithms,” Proceeding of the 1st International Conference on Genetic Algorithms ICGA-85, pp. 136–140, 1985.
Davis, L., “Applying Adaptive Algorithms to Epistatic Domains,” in Proceedings International Joint Conference on Artificial Intelligence, IJCAI-85, 1985.
Goldberg, D.E. and R. Lingle, Jr., “Alleles, Loci, and the Traveling Salesman Problem,” Proceedings of the 1st International Conference on Genetic Algorithms ICGA-85, pp. 154–159, 1985.
Maekawa, K. et. al, “A Genetic Solution for the Traveling Salesman Problem by Means of a Thermodynamical Selection Rule,” Proceedings of the 1996 International Conference on Evolutionary Computation ICEC-96, pp. 529–534, 1996.
Oliver, I.M., D.J. Smith, and J.R.C. Holland, “A Study of Permutation Crossover Operators on the Traveling Salesman Problem,” Proceedings of the 2nd International Conference on Genetic Algorithms ICGA-87, pp. 224–230, 1987.
Starkweather, T., S. McDaniel, et. al, “A Comparison of Genetic Sequencing Operators,” Proceedings of the 4th International Conference on Genetic Algorithms ICGA-91, pp. 69–76, 1991.
Syswerda, G., “Schedule Optimization Using Genetic Algorithms,” Handbook of Genetic Algorithms, L. Davis (editor), Chapter 21, Thomson Computer Press, 1990.
Wiese, K. and S.D. Goodwin, “Keep-Best Reproduction: A Selection Strategy for Genetic Algorithms,” Proceedings of the 1998 ACM Symposium on Applied Computing SAC’98, Genetic Algorithms Track, pp. 343–348, 1998.
Wiese, K., and S.D. Goodwin, “The Effect of Genetic Operator Probabilities and Selection Strategies on the Performance of a Genetic Algorithm,” Advances in Artificial Intelligence, Lecture Notes in Artificial Intelligence Vol. 1418, Springer Verlag, Germany, pp. 141–153, 1998.
Whitley D., “GENITOR: A Different Genetic Algorithm,” Proceedings of the Rocky Mountain Conference on Artificial Intelligence, Denver, Colorado, 1988.
Whitley D., T. Starkweather, and D’Ann Fuquay, “Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator,” Proceedings of the 3rd International Conference on Genetic Algorithms ICGA-89, pp. 133–140, 1989.
Whitley, D., T. Starkweather, and D. Shaner, “The Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination,” Handbook of Genetic Algorithms, L. Davis (editor), Chapter 22, Thomson Computer Press, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wiese, K.C., Goodwin, S.D., Nagarajan, S. (2000). ASERC - A Genetic Sequencing Operator for Asymmetric Permutation Problems. In: Hamilton, H.J. (eds) Advances in Artificial Intelligence. Canadian AI 2000. Lecture Notes in Computer Science(), vol 1822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45486-1_17
Download citation
DOI: https://doi.org/10.1007/3-540-45486-1_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67557-0
Online ISBN: 978-3-540-45486-1
eBook Packages: Springer Book Archive