By Topic

Improved discrete particle swarm optimization based on edge coding and multilevel reduction strategy for larger scale TSP

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

4 Author(s)
Jing Jie ; Comput. Sci. & Technol. Coll., Zhejiang Univ. of Technol., Hangzhou, China ; Huanhuan Ji ; Meng Wang ; Ming Zhao

In order to improve particle swarm optimization (PSO) to solve complex and large scale discrete optimization problems, the paper introduces an improved discrete particle swarm optimization (IDPSO) based on edge coding and multilevel reduction strategy. First, redefine the velocity and position of the particle based on edge-coding, and adopted converted insertion of the edge to update the information of the particle. Next, introduce multilevel reduction strategy to improve the global convergence ability of the algorithm. The improved algorithm is applied to solve representative cases of traveling salesman problem (TSP), The results show that the improved DPSO is efficient and valid on the complex TSP, and the multilevel reduction strategy can contribute to develop the ability of PSO when facing up to the complex and large scale problems greatly.

Published in:

Natural Computation (ICNC), 2010 Sixth International Conference on  (Volume:5 )

Date of Conference:

10-12 Aug. 2010