## New Genetic Local Search Operators for the Traveling Salesman Problem (1996)

### Cached

### Download Links

- [www.rfai.li.univ-tours.fr]
- [ftp.informatik.uni-siegen.de]
- DBLP

### Other Repositories/Bibliography

Citations: | 54 - 11 self |

### BibTeX

@INPROCEEDINGS{Freisleben96newgenetic,

author = {Bernd Freisleben and Peter Merz},

title = {New Genetic Local Search Operators for the Traveling Salesman Problem},

booktitle = {},

year = {1996},

pages = {890--899},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. In this paper, an approach is presented to incorporate problem speci c knowledge into a genetic algorithm which is used to compute near-optimum solutions to traveling salesman problems (TSP). The approach is based on using a tour construction heuristic for generating the initial population, a tour improvement heuristic for nding local optima in a given TSP search space, and new genetic operators for e ectively searching the space of local optima in order to nd the global optimum. The quality and e ciency of solutions obtained for a set of TSP instances containing between 318 and 1400 cities are presented. 1