Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation


We apply strategies inspired by natural evolution to a classical example of discrete optimization problems, the traveling salesman problem. Our algorithms are based on a new knowledge-augmented crossover operation. Even if we use only this operation in the reproduction process, we get quite good results. The most obvious faults of the solutions can be eliminated and the results can further be improved by allowing for a simple form of mutation. If each crossover is followed by an affordable local optimization, we get the optimum solution for a 318-town problem, probably the optimum solutions for several different 100-town problems, and very nearly optimum solutions for 350-town and 1000-town problems. A new strategy for the choice of parents considerably speeds up the convergence of the latter method.

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


  1. Ambati BK et al. (1991) Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the travelling salesman problem. Biol Cybern 65:31–35

  2. Banzhaf W (1990) The “molecular” traveling salesman. Biol Cybern 64:7–14

  3. Bonomi E, Lutton J-L (1984) The N-city traveling salesman problem: statistical mechanics and the Metropolis algorithm. SIAM Rev 26:551–568

  4. Brady RM (1985) Optimization strategies gleaned from biological evolution. Nature 317:804–806

  5. Crowder H, Padberg MW (1980) Solving large-scale symmetric travelling salesman problems to optimality. Management Sci 26:495–509

  6. Fogel DB (1988) An evolutionary approach to the traveling salesman problem. Biol Cybern 60:139–144

  7. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco

  8. Grefenstette J et al. (1985) Genetic algorithms for the travelling salesman problem. In: Grefenstette J (ed) Proceedings of an international conference on genetic algorithms, Carnegie-Mellon University, pp 160–169

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

  10. Hopfield JJ, Tank DW (1985) Neural computation of decisions in optimization problems. Biol Cybern 52:141–152

  11. Kirkpatrick S et al. (1983) Optimization by simulated annealing. Science 220:671–680

  12. Lin S (1965) Computer solutions for the travelling salesman problem. Bell Syst Tech J 44:2245–2269

  13. Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling salesman problem. Oper Res 21:498–516

  14. Press WH et al. (1986) Numerical recipes. Cambridge University Press, Cambridge

Download references

Author information

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Pál, K.F. Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation. Biol. Cybern. 69, 539–546 (1993).

Download citation


  • Genetic Algorithm
  • Simple Form
  • Local Optimization
  • Natural Evolution
  • Travel Salesman Problem