Skip to main content
SpringerLink
Log in

Repair and brood selection in the traveling salesman problem

  • Conference paper
  • First Online:
Parallel Problem Solving from Nature — PPSN V (PPSN 1998)

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

Included in the following conference series:

Abstract

The traveling salesman problem (TSP) has been a popular subject for genetic algorithm research. The heavy constraints of the problem make the results of a standard crossover operation invalid. This paper investigates a technique of chromosome repair called Directed Edge Repair (DER) that compensates for invalid edges from crossover or mutation. The algorithm is combined with the technique of brood selection from genetic programming and with the 3-opt local search technique. Tests on several problems from TSPLIB are reported. The algorithm was able to find optimal solutions to problems up to 1577 cities. On many of the problems, brood selection improved the accuracy of solutions without adding additional computation time.

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.

References

  1. Altenberg, L. The Evolution of Evolvability in Genetic Programming. In Kinnear, K. E., Jr.(ed.):Advances in Genetic Programming. MIT Press(1994) 47–74

    Google Scholar 

  2. Bentley, J. L.: Experiments on Traveling Salesman Heuristics. In: Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '90), San Francisco, CA, USA. SIAM (1990) 91–99

    Google Scholar 

  3. Dzubera, J., and Whitley, D.: Advanced Correlation Analysis of Operators for the Traveling Salesman Problem. In: Parallel Problem Solving From Nature — PPSN III, Jerusalem (October, 1994). Springer Verlag (1994) 68–77

    Google Scholar 

  4. Freisleben, B., and Merz, P.: New Genetic Local Search Operators for the Traveling Salesman Problem. In: Parallel Problem Solving From Nature — PPSN IV, Berlin, Germany (September 22–26, 1996). Springer-Verlag, Heidelberg (1996) 890–899

    Google Scholar 

  5. Gorges-Schleuter, M.: Asparagos96 and the Traveling Salesman Problem. In: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, Indianapolis, Indiana (April 13–16, 1997). IEEE Press (1997) 171–174

    Google Scholar 

  6. Johnson, D. S.: Local Optimization and the Traveling Salesman Problem. In: Automata, Languages and Programming, 17th International Colloquium, Warwick University, England. Springer-Verlag, Berlin (1990) 446–461

    Google Scholar 

  7. Lin, S., and Kernighan, B. W.: An Effective Heuristic Algorithm for the Traveling-Salesman Problem. Operations Research, 21 (1973) 498–516

    Article  MATH  MathSciNet  Google Scholar 

  8. Merz, P., and Freisleben, B.: Genetic Local Search for the TSP: New Results. In: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, Indianapolis, Indiana (April 13–16, 1997). IEEE Press (1997) 159–164

    Google Scholar 

  9. Michalewicz, Z. Repair Algorithms. In Bäck, T., Fogel, D. B. and Michalewicz, Z.(eds.): Handbook of Evolutionary Computation. Institute of Physics Publishing and Oxford University Press(1997) C5.4:1–5

    Google Scholar 

  10. Nagata, Y., and Kobayashi, S.: Edge Assembly Crossover: A High-power Genetic Algorithm for the Traveling Salesman Problem. In: Proceedings of the Seventh International Conference on Genetic Algorithms, East Lansing, Michigan (July 19–23, 1997). Morgan Kaufmann, San Francisco (1997) 450–457

    Google Scholar 

  11. Orvosh, D., and Davis, L.: Shall We Repair? Genetic Algorithms, Combinatorial Optimization, and Feasibility Constraints. In: Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA'93), San Mateo, California. Morgan Kaufmann, San Mateo (1993) 650

    Google Scholar 

  12. Reinelt, G.: TSPLIB-A Traveling Salesman Problem Library. ORSA Journal on Computing, 3 (4) (1991) 376–384

    MATH  Google Scholar 

  13. Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Lecture Notes in Computer Science, Vol. 840. Springer-Verlag, Heidelberg (1994)

    Google Scholar 

  14. Tackett, W. A.: Greedy Recombination and Genetic Search on the Space of Computer Programs. In: Foundations of Genetic Algorithms 3, Estes Park, Colorado. Morgan Kaufmann, San Francisco (1994) 271–297

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Redwood City, California

    Tim Walters

Authors
  1. Tim Walters
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Agoston E. Eiben Thomas Bäck Marc Schoenauer Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walters, T. (1998). Repair and brood selection in the traveling salesman problem. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056923

Download citation

  • DOI: https://doi.org/10.1007/BFb0056923

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65078-2

  • Online ISBN: 978-3-540-49672-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation