Abstract
A genetic algorithm simulating Darwinian evolution is proposed to yield near-optimal solutions to the Traveling Salesman Problem. Noting that Darwinian evolution is itself an optimization process, we propose a heuristic algorithm that incorporates the tenets of natural selection. The time complexity of this algorithm is equivalent to the fastest sorting scheme! Computer simulations indicate rapid convergence is maintained even with increasing problem complexity. This methodology can be adapted to tackle a host of other combinatorial problems.
Similar content being viewed by others
References
Beardwood J, et al. (1959) The shortest path through many points. Proc Cambridge Phil Soc 55:299–327.
Fogel DB (1988) An evolutionary approach to the traveling salesman problem. Biol Cybern 60:139–144.
Fogel DB, Atmar JW (1990) Comparing genetic operators with gaussian mutations in simulated evolutionary processes using linear systems. Biol Cybern 63:111–114.
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco.
Ghosh B (1951) Random distances within a rectangle and between two rectangles. Bull Calcutta Math Soc 43:17–24.
Grefenstette J, et al. (1985) Genetic algorithms for the traveling salesman problem. In: Grefenstette J (ed) Proceedings of an international conference on genetic algorithms. Carnegie Mellon University, pp 160–168.
Hopfield JJ, Tank DW (1985) Neural computation of decisions in optimization problems. Biol Cybern 52:141–152.
Karp RM (1977) Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane. Math Oper Res 2:209–224.
Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling salesman problem. Oper Res 21:498–516.
Santalo LA (1976) Integral geometry and geometric probability. Encyclopedia of mathematics and its applications. Addison-Wesley, New York.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ambati, B.K., Ambati, J. & Mokhtar, M.M. Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the Traveling Salesman Problem. Biol. Cybern. 65, 31–35 (1991). https://doi.org/10.1007/BF00197287
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00197287