Improved Particle Swarm Optimization For Traveling Salesman Problem

To compensate for the shortcomings of existing methods used in TSP (Traveling Salesman Problem), such as the accuracy of solutions and the scale of problems, this paper proposed an improved particle swarm optimization by using a self-organizing construction mechanism and dynamic programming algorithm. Particles are connected in way of scale-free fully informed network topology map. Then dynamic programming algorithm is applied to realize the evolution and information exchange of particles. Simulation results show that the proposed method with good stability can effectively reduce the error rate and improve the solution precision while maintaining a low computational complexity.

[1]  Hamid Abrishami Moghaddam,et al.  A Novel Constructive-Optimizer Neural Network for the Traveling Salesman Problem , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[2]  Gang Xu,et al.  Robust active contours with insensitive parameters , 1994, Pattern Recognit..

[3]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[4]  Yang Jian-mei.  PSO Algorithm Based on Network Neighborhood Topology , 2010 .

[5]  Y.F. Li,et al.  Automatic sensor placement for model-based robot vision , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[6]  Wei Zheng,et al.  Elman Fuzzy Adaptive Control for Obstacle Avoidance of Mobile Robots Using Hybrid Force/Position Incorporation , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[7]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[8]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[9]  Shengyong Chen,et al.  Agent-based Cooperative Evolutionary Computation for Disaster Rescue Operation Planning , 2012 .

[10]  Zhiqiang Zhang,et al.  An improved elastic net method for traveling salesman problem , 2009, Neurocomputing.

[11]  Yan Han,et al.  An Improved Particle Swarm Optimization for Traveling Salesman Problem , 2009, ICIC.

[12]  Chenggong Zhang,et al.  Scale-free fully informed particle swarm optimization algorithm , 2011, Inf. Sci..

[13]  James L. Crowley,et al.  MagicBoard: A contribution to an intelligent office environment , 2001, Robotics Auton. Syst..

[14]  D. J. Burr,et al.  An improved elastic net method for the traveling salesman problem , 1988, IEEE 1988 International Conference on Neural Networks.

[15]  S. Y. Chen,et al.  Kalman Filter for Robot Vision: A Survey , 2012, IEEE Transactions on Industrial Electronics.

[16]  Chunguo Wu,et al.  Solving traveling salesman problems using generalized chromosome genetic algorithm , 2008 .

[17]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.