By Topic

Solving Traveling Salesman Problems by Genetic Differential Evolution with Local Search

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
$33 $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)
Jian Li ; Dept. of Comput. Sci. & Eng., Hubei Univ. of Educ., Wuhan ; Peng Chen ; Zhiming Liu

To solve traveling salesman problems (TSP), a genetic differential evolution (GDE) was introduced, which was derived from the differential evolution (DE) and incorporated with the genetic reproduction mechanisms, namely crossover and mutation. The greedy subtour crossover (GSX) was employed to generate an offspring to denote the difference of the parents. A modified ordered crossover (MOX) was employed to perform mutation to generate trial vector with a user defined parameter, the parameter were used to control the rates of the target vector components and the mutated vector components in the trial vector. Moreover, a 2-opt local search was implemented to enhance local search performance. GDE was implemented to the well-known TSP with 52, 100 and 200 cities with variable parameters. Based on analysis and discussion on the results, typical values of the parameters were given, with which GDE provided effective and robust performance.

Published in:

Power Electronics and Intelligent Transportation System, 2008. PEITS '08. Workshop on

Date of Conference:

2-3 Aug. 2008