Abstract
This paper presented the Directed Edge recombination crossover (DERX), which was applied to the asymmetric TSP (ATSP). Unlike the ERX proposed before, the DERX divided the edge table into two parts: the right and the left adjacent edge table, which recorded the right and the left edges respectively. The operator extends the offspring tour at both ends. The right and left adjacent edges can only link to the right and the left end of the offspring respectively. Experiments show it is much better than the conventional ERX and some other crossovers, especially for the large scale ATSP.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Katayama, K.: Analysis of Crossovers and Selections in a Coarse-Grained Parallel Genetic. Algorithm Mathematical and Computer Modelling 38, 1275–1282 (2003)
Seppala, Alan, D.: Genetic algorithms for the traveling salesman problem using edge assembly crossovers. Master degree dissertation, University of Nevada, Las Vegas (2003)
Katayama, K., Hirabayashi, H., Narihisa, H.: Performance analysis of a new genetic crossover for the traveling salesman problem. IEICE tins. Fundamentals E81-A, 738–750 (1998)
Whitley, D., Starkweather, T., Shaner, D.: Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination. In: Handbook of Genetic Algorithms, Van Nostrand (1990)
Nguyen, H.D., Yoshihara, I., Yasunaga, M.: Modified edge recombination operators of genetic algorithms for the traveling salesman problem Industrial Electronics Society. In: IECON 2000. 26th Annual Conference of the IEEE, October 22-28, vol. 4, pp. 2815–2820 (2000)
Nagata, Y.: Criteria for designing crossovers for TSP Evolutionary Computation. In: Congress on CEC 2004, June 19-23, vol. 2, pp. 1465–1472 (2004)
Srinivas, M., Patnaik, L.M.: Adaptive probabilities of crossover and mutation in genetic algorithms Systems. IEEE Transactions on Man and Cybernetics 24(4), 656–667 (1994)
Zhang, J., Chung, H.S.H., Hu, B.J.: Adaptive probabilities of crossover and mutation in genetic algorithms based on clustering technique Evolutionary Computation. In: Congress on CEC 2004, June 19-23, vol. 2, pp. 2280–2287 (2004)
Gerhard Reinelt’s homepage, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/
Ting, C.-K.: Improving Edge Recombination through Alternate Inheritance and Greedy Manner. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol. 3004, pp. 210–219. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hongxin, Z., guohui, Z., shili, C. (2006). On Directed Edge Recombination Crossover for ATSP. In: Jiao, L., Wang, L., Gao, Xb., Liu, J., Wu, F. (eds) Advances in Natural Computation. ICNC 2006. Lecture Notes in Computer Science, vol 4221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881070_104
Download citation
DOI: https://doi.org/10.1007/11881070_104
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45901-9
Online ISBN: 978-3-540-45902-6
eBook Packages: Computer ScienceComputer Science (R0)