Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation
From MaRDI portal
Publication:1310113
DOI10.1007/BF01185425zbMath0800.68608MaRDI QIDQ1310113
Publication date: 2 January 1994
Published in: Biological Cybernetics (Search for Journal in Brave)
Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem
- The ``molecular traveling salesman
- ``Neural computation of decisions in optimization problems
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem