By Topic

Solving Large-Scale TSP Using Adaptive Clustering Method

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

3 Author(s)
Jin-Qiu Yang ; Coll. of Comput. Sci. & Technol., Zhejiang Univ., Hangzhou, China ; Jian-Gang Yang ; Gen-Lang Chen

TSP is a well-known NP-hard problem. Although many algorithms for solving TSP, such as linear programming, dynamic programming, genetic algorithm, anneal algorithm, and ACO algorithm have been proven to be effective, they are not so suitable for the more complicated large scale TSP. This paper offers a method to decompose the large-scale data into several small-scale data sets by its relativity; and the results of each small-scale data set which represents a small-scale TSP compose the whole result of the large-scale TSP. An adaptive clustering method is presented and a novel genetic algorithm for TSP is described in this paper.

Published in:

Computational Intelligence and Design, 2009. ISCID '09. Second International Symposium on  (Volume:1 )

Date of Conference:

12-14 Dec. 2009