Advertisement

A modified edge recombination operator for the Travelling Salesman Problem

  • Anthony Yiu-Cheung Tang
  • Kwong-Sak Leung
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 866)

Abstract

Edge recombination is a crossover operator developed to preserve edge information for the Travelling Salesman Problem. This paper describes a modified version of the operator which converges significantly faster for all the benchmark problems tested.

Keywords

Genetic Algorithm Travelling Salesman Problem Travel Salesman Problem Fixed Segment Shared Edge 
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.
    Baker, J. (1987). Reducing bias and inefficiency in the selection algorithm. Genetic algorithms and their applications: Proceedings of the Second International Conference on Genetic Algorithms. Lawrence Erlbaum Associates, Publishers.Google Scholar
  2. 2.
    Bixby, B., and Reinelt, G. (1990). TSPLIB 1.1.Google Scholar
  3. 3.
    De Jong, K. A. (1993). Genetic algorithms are not function optimizers. Foundations of Genetic Algorithms 2. Morgan Kaufmann.Google Scholar
  4. 4.
    Grefenstette, J. J. (1987). Incorporating problem specific knowledge into genetic algorithms. Genetic Algorithms and Simulated Annealing. Pitman.Google Scholar
  5. 5.
    Lin, S., and Kernighan, G. W. (1973). An efficient heuristic algorithm for the traveling salesman problem. Operations Research 21:498–516.Google Scholar
  6. 6.
    Mathias, K., and Whitley, D. (1992). Genetic operators, the fitness landscape and the traveling salesman problem. Parallel Problem Solving from Nature, 2. Elsevier Science Publishers B.V.Google Scholar
  7. 7.
    Padberg, M., and Rinaldi, G. (1991). A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. S1AM Review 33: 60–100.CrossRefGoogle Scholar
  8. 8.
    Starkweather, T., McDaniel, S., Whitley, D., and Whitley, C. (1991). A comparison of genetic sequencing operators. Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann.Google Scholar
  9. 9.
    Whitley, D. (1989). The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. Proceedings of the Third International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Anthony Yiu-Cheung Tang
    • 1
  • Kwong-Sak Leung
    • 1
  1. 1.Department of Computer ScienceThe Chinese University of Hong KongHong Kong

Personalised recommendations