Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the Traveling Salesman Problem

✍ Scribed by B. K. Ambati; J. Ambati; M. M. Mokhtar

• Publisher: Springer-Verlag
• Year: 1991
• Tongue: English
• Weight: 393 KB
• Volume: 65
• Category: Article
• ISSN: 0340-1200
• DOI: 10.1007/bf00197287

✦ Synopsis

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.