Hybrid Discrete Particle Swarm Optimizer Algorithm for Traveling Salesman Problem


Article Preview

PSO has been widely used in continuous optimization problems, but in discrete domain the research and application is very little. By redefining the position and speed of particles and related operations, the discrete particle swarm algorithm can be constructed. Due to the weak capacity of local search of PSO and be easy to constringe the local optimum, it is combined with simulated annealing and the hybrid discrete PSO is constructed using the characteristics that simulated annealing can accept some ungraded solution under the control of certain probability,finally the algorithm is applied to solving the traveling salesman problem successfully. The simulation results show that the hybrid discrete PSO can get better optimization effect, which validates the effectiveness of the method.



Advanced Materials Research (Volumes 433-440)

Edited by:

Cai Suo Zhang




H. L. Wu et al., "Hybrid Discrete Particle Swarm Optimizer Algorithm for Traveling Salesman Problem", Advanced Materials Research, Vols. 433-440, pp. 4526-4529, 2012

Online since:

January 2012




[1] Kennedy J, Eberhart R C. Particle swarm optimization [A]. Proceedings of IEEE International Conference on Neural Networks [C]. Piscataway, NJ: IEEE Press, 1995. 1942-1948.J. Clerk Maxwell, A Treatise on Electricity and Magnetism, 3rd ed., vol. 2. Oxford: Clarendon, 1892, p.68.

[2] Eberhart R C, Kennedy J. A new optimizer using particle swarm theory [A]. Proceeding of the sixth International symposium on micromachine and human science[C]. Piscataway: IEEE Service Center, 1995. 39-43.

DOI: 10.1109/mhs.1995.494215

[3] Liu Kang, Yu Ling. A Bionic Optimization Algorithm- PSO[J]. Journal of Sichuan Institute of Light Industry and Chemical Technology, 2003, (3): 9-11.

[4] Zhong Yiwen. Research of Intelligent Optimization Method and Its Application[D]. Zhejiang university doctoral thesis, (2005).

[5] Eberhart R C, Simpson P K, Dobbins R W. Computational Intelligence PC Tools [M]. Boston, MA: Academic Press Professional, (1996).

[6] Zhong Yiwen, Yang Jiangang, Ning Zhengyuan. Discrete Particle Swarm Optimization Algorithm for TSP Problem[J]. System Engineering Theory and Practice, 2006, 26: 88-94.

[7] Wang Lin, Liu Bo. Particle Swarm Optimization and Scheduling Algorithms. Tsinghua University Press, 2008, 131-133.

[8] Xie Xiaofeng, Zhang Wenjun, Yang Zhilian. Overview of Particle Swarm Optimization[J]. Control and Decision, 2003, (2): 16-20.

Fetching data from Crossref.
This may take some time to load.