Advertisement

On Directed Edge Recombination Crossover for ATSP

  • Zeng Hongxin
  • Zhang guohui
  • Cao shili
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4221)

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.

Keywords

Genetic Algorithm Travel Salesman Problem Travel Salesman Problem Crossover Operator Hamiltonian Cycle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)MATHGoogle Scholar
  2. 2.
    Katayama, K.: Analysis of Crossovers and Selections in a Coarse-Grained Parallel Genetic. Algorithm Mathematical and Computer Modelling 38, 1275–1282 (2003)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Seppala, Alan, D.: Genetic algorithms for the traveling salesman problem using edge assembly crossovers. Master degree dissertation, University of Nevada, Las Vegas (2003) Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Nagata, Y.: Criteria for designing crossovers for TSP Evolutionary Computation. In: Congress on CEC 2004, June 19-23, vol. 2, pp. 1465–1472 (2004)Google Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    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)Google Scholar
  10. 10.
  11. 11.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Zeng Hongxin
    • 1
  • Zhang guohui
    • 2
  • Cao shili
    • 1
  1. 1.The Department of Business AdministrationDongGuan University of TechnologyDongGuanChina
  2. 2.The College of Automotive EngineeringSouth China University of TechnologyGuangZhou

Personalised recommendations