DocumentCode
2619816
Title
Solving traveling salesman problem by using a local evolutionary algorithm
Author
Xuan, Wang ; Li, Yuanxiang
Author_Institution
Coll. of Comput. Sci., Wuhan Univ., China
Volume
1
fYear
2005
fDate
25-27 July 2005
Firstpage
318
Abstract
This paper introduces a new local evolutionary algorithm (LEA) and uses it to solve the traveling salesman problem. The algorithm incorporates speediness of local search methods in neighborhood search with robustness of evolutionary methods in global search in order to obtain global optimum. The experimental results show that the algorithm is of potential to obtain global optimum or more accurate solutions than other evolutionary methods for the TSP.
Keywords
evolutionary computation; problem solving; search problems; travelling salesman problems; local evolutionary algorithm; local search method; problem solving; traveling salesman problem; Application software; Cities and towns; Evolutionary computation; Iterative algorithms; Optimization methods; Printed circuits; Robustness; Search methods; Traveling salesman problems; Very large scale integration; Evolutionary Algorithm; Local search; Traveling Salesman Problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Granular Computing, 2005 IEEE International Conference on
Print_ISBN
0-7803-9017-2
Type
conf
DOI
10.1109/GRC.2005.1547294
Filename
1547294
Link To Document