The “molecular” traveling salesman
@article{Banzhaf2004TheT, title={The “molecular” traveling salesman}, author={W. Banzhaf}, journal={Biological Cybernetics}, year={2004}, volume={64}, pages={7-14} }
We consider a method for optimization of NP-problems motivated by natural evolution. The basic entity is a population of individuals searching in state space defined by the problem. A message exchange mechanism between individuals enables the system to proceed fast and to avoid local optima. We introduce the concept of isolated evolution to maintain a certain degree of variance in the population. The global optimum can be approached to an arbitrary degree. The method is applied to the TSP and… Expand
Figures, Tables, and Topics from this paper
127 Citations
Solving the Traveling Salesman Problem for Dodecahedral Graph Using an Evolutionary Algorithm
- Mathematics
- 2014
- PDF
Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation
- Mathematics
- Biological Cybernetics
- 2005
- 15
Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation
- Computer Science
- Biological Cybernetics
- 2004
- 2
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
- Mathematics, Computer Science
- GECCO '08
- 2008
- 8
- PDF
Iterative Cartesian Genetic Programming: Creating General Algorithms for Solving Travelling Salesman Problems
- Computer Science
- EuroGP
- 2016
- 10
- PDF
New evolutionary genetic algorithms for NP-complete combinatorial optimization problems
- Mathematics, Computer Science
- Biological Cybernetics
- 2004
- 23
A multi-operator genetic algorithm for the generalized minimum spanning tree problem
- Mathematics, Computer Science
- Expert Syst. Appl.
- 2016
- 18
References
SHOWING 1-10 OF 23 REFERENCES
An evolutionary approach to the traveling salesman problem
- Mathematics
- Biological Cybernetics
- 2004
- 176
- PDF