By Topic

Solving traveling salesman problem by using a local evolutionary algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wang Xuan ; Coll. of Comput. Sci., Wuhan Univ., China ; Yuanxiang Li

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.

Published in:

Granular Computing, 2005 IEEE International Conference on  (Volume:1 )

Date of Conference:

25-27 July 2005