| Article ID: | iaor1995676 |
| Country: | Netherlands |
| Volume: | 48 |
| Issue: | 3 |
| Start Page Number: | 273 |
| End Page Number: | 284 |
| Publication Date: | Feb 1994 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Kolen Antoon, Pesch Erwin |
| Keywords: | programming: travelling salesman |
The most common application of genetic algorithms to combinatorial optimization problems has been restricted to the traveling salesman problem. The authors review some of these ideas and present some new results, especially in the case that severe time constraints are imposed on the running time of the algorithm.