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 to check access.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Bonomi E, Lutton J-L (1984) TheN-City traveling salesman problem: statistical mechanics and the metropolis algorithm. SIAM Rev 26:551–568
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
Fogel LJ (1962) Atonomous automata. Ind Res 4:14–19
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
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
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
Karp RM (1977) Probabilistic analysis of partitioning algorithms for the traveling Salesman problems in the plane. Math Oper Res 2:209–224
Levy CK (1982) Elements of biology (3rd). Addison-Wesley, Reading, Mass
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
- Exact Solution
- Probabilistic Survival
- Complex Problem
- Natural Evolution
- Travel Salesman Problem