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 条
  • [31] Solving traveling salesman problem based on improved particle swarm optimization algorithm
    Wang, CR
    Zhang, JW
    Yang, J
    Sun, CJ
    Feng, HX
    Yuan, HJ
    PROCEEDINGS OF THE 11TH JOINT INTERNATIONAL COMPUTER CONFERENCE, 2005, : 368 - 373
  • [32] An Integer-Coded Chaotic Particle Swarm Optimization for Traveling Salesman Problem
    Chen Yue
    Zhang Yan-duo
    Lu Jing
    Tian Hui
    PROGRESS IN ROBOTICS, PROCEEDINGS, 2009, 44 : 372 - +
  • [33] An Adaptive Mutation Multi-particle Swarm Optimization for Traveling Salesman Problem
    Gao, Ming-fang
    Fu, Xue-liang
    Dong, Gai-fang
    Li, Hong-hui
    PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON MATERIAL, MECHANICAL AND MANUFACTURING ENGINEERING, 2015, 27 : 1003 - 1006
  • [34] A NOVEL DISCRETE RAT SWARM OPTIMIZATION (DRSO) ALGORITHM FOR SOLVING THE TRAVELING SALESMAN PROBLEM
    Mzili T.
    Riffi M.E.
    Mzili I.
    Dhiman G.
    Decision Making: Applications in Management and Engineering, 2022, 5 (02): : 287 - 299
  • [35] Solving traveling salesman problem by ant colony optimization-particle swarm optimization algorithm
    Gao, Shang
    Sun, Ling-fang
    Jiang, Xin-zi
    Tang, Ke-zong
    DCABES 2006 PROCEEDINGS, VOLS 1 AND 2, 2006, : 426 - 429
  • [36] A modified particle swarm optimization algorithm and its application for solving traveling salesman problem
    Wang, CR
    Zhang, JW
    Yang, J
    Hu, CJ
    Liu, J
    PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON NEURAL NETWORKS AND BRAIN, VOLS 1-3, 2005, : 689 - 694
  • [37] An Effective Particle Swarm Optimization Algorithm Embedded in SA to solve the Traveling Salesman Problem
    Shakouri G, H.
    Shojaee, K.
    Zahedi, H.
    CCDC 2009: 21ST CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6, PROCEEDINGS, 2009, : 5545 - +
  • [38] The modification of hybrid method of ant colony optimization, particle swarm optimization and 3-OPT algorithm in traveling salesman problem
    Hertono, G. F.
    Ubadah
    Handari, B. D.
    INTERNATIONAL CONFERENCE ON MATHEMATICS: PURE, APPLIED AND COMPUTATION, 2018, 974
  • [39] Discrete Salp Swarm Algorithm for symmetric traveling salesman problem
    Chen, Peng
    Liu, Ming
    Zhou, Shihua
    MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2023, 20 (05) : 8856 - 8874
  • [40] A combination of genetic algorithm and particle swarm optimization method for solving traveling salesman problem
    Borna, Keivan
    Khezri, Razieh
    COGENT MATHEMATICS, 2015, 2
12345