A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems

A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems (1996)

Cached

Download Links

[ftp.informatik.uni-siegen.de]

Other Repositories/Bibliography

DBLP

by Bernd Freisleben , Peter Merz

Venue:	In Proceedings of the 1996 IEEE International Conference on Evolutionary Computation
Citations:	61 - 12 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems	SVM HeaderParse 0.1
AUTHOR NAME	Bernd Freisleben	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Electrical Engineering and Computer Science (FB 12); University of Siegen	SVM HeaderParse 0.2
AUTHOR ADDR	Holderlinstr. 3, D--57068 Siegen, Germany	SVM HeaderParse 0.1
AUTHOR NAME	Peter Merz	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Electrical Engineering and Computer Science (FB 12); University of Siegen	SVM HeaderParse 0.2
AUTHOR ADDR	Holderlinstr. 3, D--57068 Siegen, Germany	SVM HeaderParse 0.1
ABSTRACT	The combination of local search heuristics and genetic algorithms is a promising approach for finding nearoptimum solutions to the traveling salesman problem (TSP). In this paper, an approach is presented in which local search techniques are used to find local optima in a given TSP search space, and genetic algorithms are used to search the space of local optima in order to find the global optimum. New genetic operators for realizing the proposed approach are described, and the quality and efficiency of the solutions obtained for a set of symmetric and asymmetric TSP instances are discussed. The results indicate that it is possible to arrive at high quality solutions in reasonable time. I. Introduction In the Traveling Salesman Problem (TSP) [18], [27], a number of cities with distances between them is given and the task is to find the minimum--length closed tour that visits each city once and returns to its starting point. A symmetric TSP (STSP) is one where the distance between any...	user correction - Legacy Corrections
YEAR	1996	INFERENCE
VENUE	In Proceedings of the 1996 IEEE International Conference on Evolutionary Computation	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	616--621	INFERENCE
CITATIONS	30 found	ParsCit 1.0