An Improved Hybrid Discrete Particle Swarm Optimization Algorithm to Solve the TSP Problem

摘要：

Through investigating the issue of solving the TSP problem by discrete particle swarm optimization algorithm, this study finds a new discrete particle swarm optimization algorithm (NDPSO), which is easy to combine with other algorithm and has fast convergence and high accuracy, by introducing the thought of the greedy algorithm and GA algorithm and refining the discrete particle swarm optimization algorithm. And then the study expands NDPSO by Simulated Annealing algorithm and proposes a hybrid discrete particle swarm optimization algorithm (HDPSO). At last, the experiments prove that these two algorithms both have good convergence, but the HDPSO has a better capacity to find the best solution.

关键词： Hybrid Discrete Swarm Optimization TSP Problem Simulated Annealing

作者: Xiao Bin Li Zhaohui

作者单位: School of Software, Beijing University of Posts and Telecommunications, China

会议类型: 国际会议

会议名称: 2011 3nd International Conference on Mechanical and Electronics Engineering(2011年第三届机械与电子工程国际会议 ICMEE2011)

会议地点: 合肥

会议语种:英文

页码: 3589-3594

在线出版日期: 2011-09-23（万方平台首次上网日期，不代表论文的发表时间）