Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the Traveling Salesman Problem
- 1 May 1991
- journal article
- Published by Springer Science and Business Media LLC in Biological Cybernetics
- Vol. 65 (1), 31-35
- https://doi.org/10.1007/bf00197287
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Comparing genetic operators with gaussian mutations in simulated evolutionary processes using linear systemsBiological Cybernetics, 1990
- An evolutionary approach to the traveling salesman problemBiological Cybernetics, 1988
- “Neural” computation of decisions in optimization problemsBiological Cybernetics, 1985
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the PlaneMathematics of Operations Research, 1977
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959