Skip to main content
SpringerLink
Log in

An evolutionary approach to the traveling salesman problem

  • Published:
Biological Cybernetics Aims and scope Submit manuscript

Abstract

Evolutionary optimization has been proposed as a method to generate machine learning through automated discovery. A simulation of natural evolution is conducted using the traveling salesman problem as an artificial environment. For an exact solution of a traveling salesman problem, the only known algorithms require the number of steps to grow at least exponentially with the number of elements in the problem. Three adaptive techniques are described and analyzed. Evolutionary adaptation is demonstrated to be worthwhile in a variety of contexts. Local stagnation is prevented by allowing for the probabilistic survival of the simulated organisms. In complex problems, the final routing is estimated to be better than 99.99999999999% of all possible tours, even though only a small fraction (8.58 × 10−151) of the total number of tours are examined.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bonomi E, Lutton J-L (1984) TheN-City traveling salesman problem: statistical mechanics and the metropolis algorithm. SIAM Rev 26:551–568

    Google Scholar 

  • Christofides N (1976) Worst-case analysis of a new heuristic for the traveling salesman problem. Report 388, Graduate School of Industrial Administration, Carnegie Mellon University

  • Dewdney AK (1985) Computer recreations: exploring the field of genetic algorithms in a primordial computer sea full of flibs. Sci Am 253:21–31

    Google Scholar 

  • Fogel LJ (1962) Atonomous automata. Ind Res 4:14–19

    Google Scholar 

  • Fogel LJ (1964) On the organization of intellect. Ph. D. Dissertation, UCLA

  • Fogel LJ, Owens AJ, Walsh MJ (1966) Artificial intelligence through simulated evolution. Wiley, New York

    Google Scholar 

  • Goldberg DE, Lingle R (1985) Alleles, loci, and the traveling salesman problem. In: Grefenstette JJ (eds) Proceedings of an International Conference on Genetic Algorithms and Their Applications. Carnegie-Mellon University, pp 154–159

  • Golden BL, Skiscim CC (1986) Using simulated annealing to solve routing and location problems. Nav Res Log Q 33:261–279

    Google Scholar 

  • Grefenstette JJ, Gopal R, Rosmaita B, Van Gucht D (1985) Genetic algorithms for the traveling salesman problem. In: Grefenstette JJ (eds) Proceedings of an International Conference on Genetic Algorithms and Their Applications. Carnegie-Mellon University, pp 160–168

  • Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, Mich

    Google Scholar 

  • Karp RM (1977) Probabilistic analysis of partitioning algorithms for the traveling Salesman problems in the plane. Math Oper Res 2:209–224

    Google Scholar 

  • Levy CK (1982) Elements of biology (3rd). Addison-Wesley, Reading, Mass

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ORINCON Corporation, 9363 Towne Centre Dr., 92121, San Diego, CA, USA

    D. B. Fogel

Authors
  1. D. B. Fogel
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fogel, D.B. An evolutionary approach to the traveling salesman problem. Biol. Cybern. 60, 139–144 (1988). https://doi.org/10.1007/BF00202901

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation