An improved discrete particle swarm optimization algorithm for TSP

被引:9
|
作者
Zhang, Changsheng [1 ]
Sun, Jigui [1 ]
Wang, Yan [1 ]
Yang, Qingyun [2 ]
机构
[1] Jilin Univ, Coll Comp Sci & Technol, Changchun, Peoples R China
[2] Chinese Acad Sci, Changchun Inst Opt Fine Mech & Phys, Beijing 100864, Peoples R China
关键词
D O I
10.1109/WI-IATW.2007.38
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
An Improved discrete particle swarm optimization (DPSO)-based algorithm for the traveling salesman problem (TSP) is proposed In order to overcome the problem of premature convergence, a novel depressor is proposed and a diversity measure to control the swarm is also introduced which can be used to switch between the attractor and depressor. The proposed algorithm has been applied to a set of benchmark problems and compared with the existing algorithms for solving TSP using swarm intelligence. The results show that it can prevent premature convergence to a high degree, but still keeps a rapid convergence like the basic DPSO.
引用
收藏
页码:35 / +
页数:2
相关论文
共 50 条
  • [1] An Improved Hybrid Discrete Particle Swarm Optimization Algorithm to Solve the TSP Problem
    Xiao Bin
    Li Zhaohui
    [J]. MECHANICAL AND ELECTRONICS ENGINEERING III, PTS 1-5, 2012, 130-134 : 3589 - 3594
  • [2] A Discrete Particle Swarm Optimization Algorithm for Solving TSP under Dynamic Topology
    Wang, Shuo
    Zhang, Jiandong
    Zhang, Zhen
    Yu, Xiao
    [J]. PROCEEDINGS OF THE IEEE 2019 9TH INTERNATIONAL CONFERENCE ON CYBERNETICS AND INTELLIGENT SYSTEMS (CIS) ROBOTICS, AUTOMATION AND MECHATRONICS (RAM) (CIS & RAM 2019), 2019, : 165 - 170
  • [3] Brain Storm Optimization with Discrete Particle Swarm Optimization for TSP
    Hua, Zhoudong
    Chen, Junfeng
    Xie, Yingjuan
    [J]. PROCEEDINGS OF 2016 12TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2016, : 190 - 193
  • [4] Adjustability of a discrete particle swarm optimization for the dynamic TSP
    Łukasz Strąk
    Rafał Skinderowicz
    Urszula Boryczka
    [J]. Soft Computing, 2018, 22 : 7633 - 7648
  • [5] Adjustability of a discrete particle swarm optimization for the dynamic TSP
    Strak, Lukasz
    Skinderowicz, Rafal
    Boryczka, Urszula
    [J]. SOFT COMPUTING, 2018, 22 (22) : 7633 - 7648
  • [6] A SOLUTION OF TSP BASED ON THE ANT COLONY ALGORITHM IMPROVED BY PARTICLE SWARM OPTIMIZATION
    Yu, Miao
    [J]. DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS-SERIES S, 2019, 12 (4-5): : 979 - 987
  • [7] An Improved Particle Swarm Optimization Algorithm
    Jiang, Changyuan
    Zhao, Shuguang
    Guo, Lizheng
    Ji, Chuan
    [J]. MECHANICAL ENGINEERING AND INTELLIGENT SYSTEMS, PTS 1 AND 2, 2012, 195-196 : 1060 - 1065
  • [8] An Improved Particle Swarm Optimization Algorithm
    Ji, Weidong
    Wang, Keqi
    [J]. 2011 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT), VOLS 1-4, 2012, : 585 - 589
  • [9] An Improved Particle Swarm Optimization Algorithm
    Wang, Fangxiu
    Zhou, Kong
    [J]. 2012 INTERNATIONAL CONFERENCE ON INTELLIGENCE SCIENCE AND INFORMATION ENGINEERING, 2012, 20 : 156 - 158
  • [10] An Improved Particle Swarm Optimization Algorithm
    Lu, Lin
    Luo, Qi
    Liu, Jun-yong
    Long, Chuan
    [J]. 2008 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING, VOLS 1 AND 2, 2008, : 486 - 490