By Topic

Using Genetic Algorithm Based on Composite Statistical Functions to Solve TSP by Nodes Regrouping

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)
Chen Jie ; Comput. Sch., Hubei Univ. of Technol., Wuhan, China ; Ma Ya-hui

As the traditional evolutionary algorithms for large-scale TSP(Traveling Salesman Problem) produce so huge amount of paths vectors with random that the slow and premature convergence is nearly inevitable,this paper presents a novel evolutional algorithm based on hybrid probability distribution(EABHPD) with area partition strategy. The fundamental idea is to use evolutionary algorithm twice.Firstly the large-scale TSP is divided into several small-scale TSP, then each sub-TSP can be solved with EABHPD.With EABHPD, the rules of mutation are the combination of Gaussian probability distribution,Cauchy probability distribution and t probability distribution. This designed algorithm can get a good compromise of the desired pricision and computation cost, it also can avoid the premature convergence problem of the common evolutionary algorithms.Besides,the efficiency of our approach is manifested by the preliminary simulation experiment .

Published in:

Internet Technology and Applications (iTAP), 2011 International Conference on

Date of Conference:

16-18 Aug. 2011