A hybrid discrete particle swarm optimization for the traveling salesman problem

被引:0
|
作者
Li, Xiangyong [1 ]
Tian, Peng [1 ]
Hua, Jing [1 ]
Zhong, Ning [1 ]
机构
[1] Shanghai Jiao Tong Univ, Coll Econ & Management, Shanghai 200052, Peoples R China
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a hybrid discrete particle swarm optimization (HDPSO) for solving the traveling salesman problem (TSP). The HDPSO combines anew discrete particle swarm optimization (DPSO) with a local search. DPSO is an approach designed for the TSP based on the binary version of particle swarm optimization. Unlike in general versions of particle swarm optimization, DPSO redefines the particle's position and velocity, and then updates its state by using a tour construction. The embedded local search is implemented to improve the solutions generated by DPSO. The experimental results on some instances are reported and indicate HDPSO can be used to solve TSPs.
引用
收藏
页码:181 / 188
页数:8
相关论文
共 50 条
  • [11] An improved particle swarm optimization for traveling salesman problem
    Liu, Xinmei
    Su, Jinrong
    Han, Yan
    ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS, PROCEEDINGS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2007, 4682 : 803 - 812
  • [12] IMPROVED PARTICLE SWARM OPTIMIZATION FOR TRAVELING SALESMAN PROBLEM
    Xu, Xin-Li
    Cheng, Xu
    Yang, Zhong-Chen
    Yang, Xu-Hua
    Wang, Wan-Liang
    PROCEEDINGS 27TH EUROPEAN CONFERENCE ON MODELLING AND SIMULATION ECMS 2013, 2013, : 857 - +
  • [13] A Hybrid Multi-Swarm Particle Swarm Optimization algorithm for the Probabilistic Traveling Salesman Problem
    Marinakis, Yannis
    Marinaki, Magdalene
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (03) : 432 - 442
  • [14] Discrete Novel Hybrid Particle Swarm Optimization To Solve Travelling Salesman Problem
    Bouzidi, Morad
    Essaid Riffi, Mohammed
    2014 5TH WORKSHOP ON CODES, CRYPTOGRAPHY AND COMMUNICATION SYSTEMS (WCCCS' 14), 2014, : 17 - 20
  • [15] Geese-inspired Hybrid Particle Swarm Optimization Algorithm for Traveling Salesman Problem
    Sun, Jingjing
    Lei, Xiujuan
    2009 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL INTELLIGENCE, VOL I, PROCEEDINGS, 2009, : 134 - 138
  • [16] Hybrid K-means and Particle Swarm Optimization for Symmetric Traveling Salesman Problem
    Munlin, Mud-Armeen
    Anantathanavit, Mana
    PROCEEDINGS OF THE 2015 10TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS, 2015, : 677 - 682
  • [17] Particle swarm for the traveling salesman problem
    Gouvea Goldbarg, Elizabeth F.
    de Souza, Givanaldo R.
    Goldbarg, Marco Cesar
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2006, 3906 : 99 - 110
  • [18] Chaotic particle swarm optimization algorithm for traveling salesman problem
    Yuan, Zhenglei
    Yang, Liliang
    Wu, Yaohua
    Liao, Li
    Li, Guoqiang
    2007 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS, VOLS 1-6, 2007, : 1121 - 1124
  • [19] New Discrete Chaotic Particle Swarm Algorithm for Traveling Salesman Problem
    Li, Jiuyong
    Wang, Jing
    MANUFACTURING PROCESSES AND SYSTEMS, PTS 1-2, 2011, 148-149 : 210 - 214
  • [20] Intuitionistic Fuzzy Hybrid Discrete Particle Swarm Optimization for Solving Travelling Salesman Problem
    Mei, Hai-Tao
    Hua, Ji-Xue
    Wang, Yi
    Wen, Tong
    PROCEEDINGS OF THE 2016 5TH INTERNATIONAL CONFERENCE ON ADVANCED MATERIALS AND COMPUTER SCIENCE, 2016, 80 : 765 - 771