A modified edge recombination operator for the Travelling Salesman Problem | SpringerLink
Skip to main content
Springer Nature Link
Log in

A modified edge recombination operator for the Travelling Salesman Problem

  • Conference paper
  • First Online:
Parallel Problem Solving from Nature — PPSN III (PPSN 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 866))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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. Bixby, B., and Reinelt, G. (1990). TSPLIB 1.1.

    Google Scholar 

  3. De Jong, K. A. (1993). Genetic algorithms are not function optimizers. Foundations of Genetic Algorithms 2. Morgan Kaufmann.

    Google Scholar 

  4. Grefenstette, J. J. (1987). Incorporating problem specific knowledge into genetic algorithms. Genetic Algorithms and Simulated Annealing. Pitman.

    Google Scholar 

  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. 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. 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.

    Article  Google Scholar 

  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. 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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Chinese University of Hong Kong, Hong Kong

    Anthony Yiu-Cheung Tang & Kwong-Sak Leung

Authors
  1. Anthony Yiu-Cheung Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kwong-Sak Leung
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Yuval Davidor Hans-Paul Schwefel Reinhard Männer

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yiu-Cheung Tang, A., Leung, KS. (1994). A modified edge recombination operator for the Travelling Salesman Problem. In: Davidor, Y., Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature — PPSN III. PPSN 1994. Lecture Notes in Computer Science, vol 866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58484-6_262

Download citation

  • DOI: https://doi.org/10.1007/3-540-58484-6_262

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58484-1

  • Online ISBN: 978-3-540-49001-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation