๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by Balamurali Krishna Ambati; Jayakrishna Ambati; Mazen Moein Mokhtar

Publisher
Springer-Verlag
Year
1992
Tongue
English
Weight
40 KB
Volume
66
Category
Article
ISSN
0340-1200

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Heuristic combinatorial optimization by
Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the Traveling Salesman Problem
โœ B. K. Ambati; J. Ambati; M. M. Mokhtar ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 393 KB

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