Advertisement

Biological Cybernetics

, Volume 64, Issue 1, pp 7–14 | Cite as

The “molecular” traveling salesman

  • W. Banzhaf
Article

Abstract

We consider a method for optimization of NP-problems motivated by natural evolution. The basic entity is a population of individuals searching in state space defined by the problem. A message exchange mechanism between individuals enables the system to proceed fast and to avoid local optima. We introduce the concept of isolated evolution to maintain a certain degree of variance in the population. The global optimum can be approached to an arbitrary degree. The method is applied to the TSP and its behavior is shown in a couple of simulations.

Keywords

State Space Global Optimum Local Optimum Exchange Mechanism Natural Evolution 
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. Bonomi E, Lutton J-L (1984) The N-city traveling salesman problem: Statistical mechanics and the metropolis algorithm. SIAM Rev 26:551–568CrossRefGoogle Scholar
  2. Boseniuk T, Ebeling W, Engel A (1987) Boltzmann and Darwin strategies in complex optimization. Phys Lett 125A:307–310Google Scholar
  3. Brady RM (1985) Optimization strategies gleaned from natural evolution. Nature 317:804–806Google Scholar
  4. Bremermann HJ, Rogson M, Salaff S (1965) Search by evolution. In: Maxfield M, Callahan A, Fogel LJ (eds) Biophysics and cybernetic systems. Spartan Books, Washington, pp 157–167Google Scholar
  5. Fogel DB (1989) An evolutionary approach to the traveling salesman problem. Biol Cybern 60:139–144CrossRefGoogle Scholar
  6. Fontana W, Schuster P (1987) A computer model of evolutionary optimization. Biophys Chem 26:123–147CrossRefPubMedGoogle Scholar
  7. Grefenstette JJ, Gopal R, Rosmaita B, Van Gucht D (1985) Genetic algorithms for the traveling salesman problem. In: Grefenstette JJ (ed) Proceedings of the International Conference on Genetic Algorithms and their Applications. Carnegie Mellon University, Pittsburgh, pp 160–168Google Scholar
  8. Holland JH (1975) Adaption in natural and artificial systems. University of Michigan Press, Ann ArborGoogle Scholar
  9. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680Google Scholar
  10. Lawler E (1976) Combinatorial optimization, networks and matroids. Holt, Rinehart and Winston, New YorkGoogle Scholar
  11. Lawler E, Lenstra A, Rinnooy Kan G (1985) The traveling salesman problem. Wiley, New YorkGoogle Scholar
  12. Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller EJ (1953) Equations of state calculations by fast computing machines. J Chem Phys 21:1087–1091CrossRefGoogle Scholar
  13. Mühlenbein H, Gorges-Schleuter M, Krämer O (1988) Evolution algorithms in combinatorial optimazation. Par Comp 7:65–85CrossRefGoogle Scholar
  14. Rechenberg I (1973) Evolutionsstrategien. Frommann-Holzboog, StuttgartGoogle Scholar
  15. Schwefel HP (1981) Numerical optimization of computer models. Wiley, ChichesterGoogle Scholar
  16. Wang Q (1987) Optimization by simulating molecular evolution. Biol Cybern 57:95–101CrossRefPubMedGoogle Scholar

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • W. Banzhaf
    • 1
  1. 1.Central Research LaboratoryMitsubishi Electric CorporationHyogoJapan

Personalised recommendations