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 条
  • [1] A Hybrid Discrete Particle Swarm Optimization with Pheromone for Dynamic Traveling Salesman Problem
    Boryczka, Urszula
    Strak, Lukasz
    COMPUTATIONAL COLLECTIVE INTELLIGENCE - TECHNOLOGIES AND APPLICATIONS, PT II, 2012, 7654 : 503 - 512
  • [2] A hybrid particle swarm optimization model for the traveling salesman problem
    Machado, TR
    Lopes, HS
    ADAPTIVE AND NATURAL COMPUTING ALGORITHMS, 2005, : 255 - 258
  • [3] Hybrid Discrete Particle Swarm Optimizer Algorithm for Traveling salesman problem
    Wu Hua-li
    Wu Jin-hua
    Liu Ai-li
    MATERIALS SCIENCE AND INFORMATION TECHNOLOGY, PTS 1-8, 2012, 433-440 : 4526 - 4529
  • [4] Fuzzy discrete particle swarm optimization for solving traveling salesman problem
    Pang, W
    Wang, KP
    Zhou, CG
    Dong, LJ
    FOURTH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY, PROCEEDINGS, 2004, : 796 - 800
  • [5] Novel discrete Particle Swarm Optimization to solve Traveling Salesman Problem
    Zhong, Wen-liang
    Zhang, Jun
    Chen, Wei-neng
    2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 3283 - 3287
  • [6] Discrete Fuzzy Particle Swarm Optimization for Solving Traveling Salesman Problem
    Niasar, N. Salmani
    Shanbezade, J.
    Perdam, M. M.
    Mohajeri, M.
    2009 INTERNATIONAL CONFERENCE ON INFORMATION AND FINANCIAL ENGINEERING, PROCEEDINGS, 2009, : 162 - +
  • [7] A Discrete Particle Swarm Optimization Algorithm for the Generalized Traveling Salesman Problem
    Tasgetiren, M. Fatih
    Suganthan, P. N.
    Pan, Quan-Ke
    GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2007, : 158 - +
  • [8] Discrete Particle Swarm Optimization Algorithm for Weighted Traveling Salesman Problem
    Zeng, Hua
    Liu, Peng
    Shen, Changpeng
    Wu, Yaohua
    2010 8TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA), 2010, : 2008 - 2013
  • [9] Particle swarm optimization for Traveling Salesman Problem
    Wang, KP
    Huang, L
    Zhou, CG
    Pang, W
    2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, : 1583 - 1585
  • [10] Studying solutions of Traveling Salesman Problem with hybrid Particle Swarm Optimization
    Martins, Helga G.
    Barros, Mateus
    De Araujo, Bruno Tonsic
    Bo, Renato Y.
    Faleiros, Leandro
    Lambert-Torres, Germano
    ACMOS '08: PROCEEDINGS OF THE 10TH WSEAS INTERNATIONAL CONFERENCE ON AUTOMATIC CONTROL, MODELLING AND SIMULATION, 2008, : 338 - +
12345