Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation
- 1 September 1993
- journal article
- Published by Springer Nature in Biological Cybernetics
- Vol. 69 (5-6) , 539-546
- https://doi.org/10.1007/bf01185425
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Adaptation in Natural and Artificial SystemsPublished by MIT Press ,1992
- Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the Traveling Salesman ProblemBiological Cybernetics, 1991
- The “molecular” traveling salesmanBiological Cybernetics, 1990
- An evolutionary approach to the traveling salesman problemBiological Cybernetics, 1988
- Optimization strategies gleaned from biological evolutionNature, 1985
- “Neural” computation of decisions in optimization problemsBiological Cybernetics, 1985
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis AlgorithmSIAM Review, 1984
- Optimization by Simulated AnnealingScience, 1983
- Solving Large-Scale Symmetric Travelling Salesman Problems to OptimalityManagement Science, 1980
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965