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 条
  • [21] A discrete particle swarm optimization algorithm for travelling salesman problem
    Shi, X. H.
    Zhou, Y.
    Wang, L. M.
    Wang, Q. X.
    Liang, Y. C.
    COMPUTATIONAL METHODS, PTS 1 AND 2, 2006, : 1063 - +
  • [22] Solve traveling salesman problem using particle swarm optimization algorithm
    Yan, Xuesong
    Zhang, Can
    Luo, Wenjing
    Li, Wei
    Chen, Wei
    Liu, Hanmin
    International Journal of Computer Science Issues, 2012, 9 (6 6-2): : 264 - 271
  • [23] Particle Swarm Optimization Based on Neighborhood Encoding for Traveling Salesman Problem
    Lin, Dongmei
    Qiu, Shenshan
    Wang, Dong
    2008 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC), VOLS 1-6, 2008, : 1275 - +
  • [24] Fuzzy particle swarm optimization algorithm in solving traveling salesman problem
    Zhang, Jiashun
    Lv, Rongjie
    International Review on Computers and Software, 2012, 7 (05) : 2593 - 2597
  • [25] A Novel Adaptive Particle Swarm Optimization to Solve Traveling Salesman Problem
    Song, Weitang
    Zhang, Shumei
    2009 ISECS INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT, VOL II, 2009, : 459 - 462
  • [26] Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem
    Zhong, Yiwen
    Lin, Juan
    Wang, Lijin
    Zhang, Hui
    SWARM AND EVOLUTIONARY COMPUTATION, 2018, 42 : 77 - 88
  • [27] Traveling Salesman Problem Using an Enhanced Hybrid Swarm Optimization Algorithm
    郑建国
    伍大清
    周亮
    Journal of Donghua University(English Edition), 2014, 31 (03) : 362 - 367
  • [28] Parallel discrete lion swarm optimization algorithm for solving traveling salesman problem
    Zhang Daoqing
    Jiang Mingyan
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2020, 31 (04) : 751 - 760
  • [29] Parallel discrete lion swarm optimization algorithm for solving traveling salesman problem
    ZHANG Daoqing
    JIANG Mingyan
    Journal of Systems Engineering and Electronics, 2020, 31 (04) : 751 - 760
  • [30] Particle Swarm Optimization Combined with Ant Colony Optimization for the Multiple Traveling Salesman Problem
    Feng, H. K.
    Bao, J. S.
    Jin, Y.
    ADVANCES IN MATERIALS MANUFACTURING SCIENCE AND TECHNOLOGY XIII, VOL 1: ADVANCED MANUFACTURING TECHNOLOGY AND EQUIPMENT, AND MANUFACTURING SYSTEMS AND AUTOMATION, 2009, 626-627 : 717 - +
12345