IMPROVED PARTICLE SWARM OPTIMIZATION FOR TRAVELING SALESMAN PROBLEM

被引：1
|
作者：
Xu, Xin-Li [1 ]
Cheng, Xu [1 ]
Yang, Zhong-Chen [1 ]
Yang, Xu-Hua [1 ]
Wang, Wan-Liang [1 ]
机构：
[1] Zhejiang Univ Technol, Coll Comp Sci & Technol, Hangzhou 310023, Zhejiang, Peoples R China
来源：
PROCEEDINGS 27TH EUROPEAN CONFERENCE ON MODELLING AND SIMULATION ECMS 2013 | 2013年
关键词：
Particle swarm algorithm; dynamic programming algorithm; scale-free fully informed network; travelling salesman problem;
D O I：
10.7148/2013-0862
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
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.
引用
收藏
页码：857 / +
页数：3
相关论文
共 50 条
  • [1] An improved particle swarm optimization for traveling salesman problem
    Liu, Xinmei
    Su, Jinrong
    Han, Yan
    [J]. ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS, PROCEEDINGS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2007, 4682 : 803 - 812
  • [2] Particle swarm optimization for Traveling Salesman Problem
    Wang, KP
    Huang, L
    Zhou, CG
    Pang, W
    [J]. 2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, : 1583 - 1585
  • [3] Solving traveling salesman problem based on improved particle swarm optimization algorithm
    Wang, CR
    Zhang, JW
    Yang, J
    Sun, CJ
    Feng, HX
    Yuan, HJ
    [J]. PROCEEDINGS OF THE 11TH JOINT INTERNATIONAL COMPUTER CONFERENCE, 2005, : 368 - 373
  • [4] A hybrid particle swarm optimization model for the traveling salesman problem
    Machado, TR
    Lopes, HS
    [J]. ADAPTIVE AND NATURAL COMPUTING ALGORITHMS, 2005, : 255 - 258
  • [5] A hybrid discrete particle swarm optimization for the traveling salesman problem
    Li, Xiangyong
    Tian, Peng
    Hua, Jing
    Zhong, Ning
    [J]. SIMULATED EVOLUTION AND LEARNING, PROCEEDINGS, 2006, 4247 : 181 - 188
  • [6] Particle swarm for the traveling salesman problem
    Gouvea Goldbarg, Elizabeth F.
    de Souza, Givanaldo R.
    Goldbarg, Marco Cesar
    [J]. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2006, 3906 : 99 - 110
  • [7] Chaotic particle swarm optimization algorithm for traveling salesman problem
    Yuan, Zhenglei
    Yang, Liliang
    Wu, Yaohua
    Liao, Li
    Li, Guoqiang
    [J]. 2007 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS, VOLS 1-6, 2007, : 1121 - 1124
  • [8] Studying solutions of Traveling Salesman Problem with hybrid Particle Swarm Optimization
    Martins, Helga G.
    Barros, Mateus
    De Araujo, Bruno Tonsic
    Bo, Renato Y.
    Faleiros, Leandro
    Lambert-Torres, Germano
    [J]. ACMOS '08: PROCEEDINGS OF THE 10TH WSEAS INTERNATIONAL CONFERENCE ON AUTOMATIC CONTROL, MODELLING AND SIMULATION, 2008, : 338 - +
  • [9] Solve traveling salesman problem using particle swarm optimization algorithm
    Yan, Xuesong
    Zhang, Can
    Luo, Wenjing
    Li, Wei
    Chen, Wei
    Liu, Hanmin
    [J]. International Journal of Computer Science Issues, 2012, 9 (6 6-2): : 264 - 271
  • [10] Fuzzy discrete particle swarm optimization for solving traveling salesman problem
    Pang, W
    Wang, KP
    Zhou, CG
    Dong, LJ
    [J]. FOURTH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY, PROCEEDINGS, 2004, : 796 - 800
12345