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
来源：
SIMULATED EVOLUTION AND LEARNING, PROCEEDINGS | 2006年 / 4247卷
关键词：
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 条
  • [41] Modified particle swarm optimization based on space transformation for solving traveling salesman problem
    Pang, W
    Wang, KP
    Zhou, CG
    Dong, LJ
    Liu, M
    Zhang, HY
    Wang, JY
    PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 2342 - 2346
  • [42] A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem
    Mahi, Mostafa
    Baykan, Omer Kaan
    Kodaz, Halife
    APPLIED SOFT COMPUTING, 2015, 30 : 484 - 490
  • [43] Application of Particle Swarm Optimization for Traveling Salesman Problem to Lossless Compression of Color Palette Images
    Van Hook, Joshua
    Sahin, Ferat
    Arnavut, Ziya
    2008 IEEE INTERNATIONAL CONFERENCE ON SYSTEM OF SYSTEMS ENGINEERING (SOSE), 2008, : 448 - +
  • [44] Multi-Subdomain Grouping-Based Particle Swarm Optimization for the Traveling Salesman Problem
    Cui, Ying
    Zhong, Jiabao
    Yang, Fengru
    Li, Shixin
    Li, Penghao
    IEEE ACCESS, 2020, 8 : 227497 - 227510
  • [45] Application of particle swarm optimization for traveling salesman problem to lossless compression of color palette images
    Electrical Engineering, Rochester Institute of Technology, Rochester, NY 14623, United States
    不详
    IEEE Int. Conf. Syst. Syst. Eng., SoSE, 2008,
  • [46] Modified particle swarm optimization for solving traveling salesman problem based on a Hadoop MapReduce framework
    Chang, Jhih-Chung
    PROCEEDINGS OF 2016 INTERNATIONAL CONFERENCE ON APPLIED SYSTEM INNOVATION (ICASI), 2016,
  • [47] DEVELOPING A HYBRID DATA MINING APPROACH BASED ON MULTI-OBJECTIVE PARTICLE SWARM OPTIMIZATION FOR SOLVING A TRAVELING SALESMAN PROBLEM
    Haeri, Abdorrahman
    Tavakkoli-Moghaddam, Reza
    JOURNAL OF BUSINESS ECONOMICS AND MANAGEMENT, 2012, 13 (05) : 951 - 967
  • [48] Chaotic hybrid discrete bat algorithm for traveling salesman problem
    Qi Y.-H.
    Cai Y.-G.
    Cai H.
    Tang Y.-L.
    Lü W.-X.
    1600, Chinese Institute of Electronics (44): : 2543 - 2547
  • [49] A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem
    Jiang, Zi-Bin
    Yang, Qiong
    PLOS ONE, 2016, 11 (11):
  • [50] Hybrid Particle Swarm Optimization Algorithm for Large-scale Travelling Salesman Problem
    Zhang, Jiangwei
    APPLIED SCIENCE, MATERIALS SCIENCE AND INFORMATION TECHNOLOGIES IN INDUSTRY, 2014, 513-517 : 1773 - 1778
12345