DocumentCode
527505
Title
Improved discrete particle swarm optimization based on edge coding and multilevel reduction strategy for larger scale TSP
Author
Jie, Jing ; Ji, Huanhuan ; Wang, Meng ; Zhao, Ming
Author_Institution
Comput. Sci. & Technol. Coll., Zhejiang Univ. of Technol., Hangzhou, China
Volume
5
fYear
2010
fDate
10-12 Aug. 2010
Firstpage
2633
Lastpage
2637
Abstract
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.
Keywords
computational complexity; convergence; particle swarm optimisation; travelling salesman problems; discrete particle swarm optimization; edge coding; global convergence ability; multilevel reduction strategy; travelling salesman problem; Algorithm design and analysis; Cities and towns; Encoding; Optimization; Particle swarm optimization; Software algorithms; Traveling salesman problems; TSP; discrete optimization; edge coding; multilevel reduction; particle swarm optimization;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation (ICNC), 2010 Sixth International Conference on
Conference_Location
Yantai, Shandong
Print_ISBN
978-1-4244-5958-2
Type
conf
DOI
10.1109/ICNC.2010.5583019
Filename
5583019
Link To Document