New Discrete Chaotic Particle Swarm Algorithm for Traveling Salesman Problem

被引：0
|
作者：
Li, Jiuyong [1 ]
Wang, Jing [1 ]
机构：
[1] Univ Sci & Technol Beijing, NERCAR, Beijing 100083, Peoples R China
来源：
MANUFACTURING PROCESSES AND SYSTEMS, PTS 1-2 | 2011年 / 148-149卷
关键词：
Particle swarm optimization(PSO); Traveling Salesman Problem(TSP); Chaos theory; Information intercourse;
D O I：
10.4028/www.scientific.net/AMR.148-149.210
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In this paper, a novel algorithm called CIPSO for short based on particle optimization algorithm(PSO) and Chaos optimization Algorithm(COA) is presented to solve traveling salesman problem(TSP). We propose some new operators to solve the difficulties of implementing PSO into solving this discrete problem based on the special fitness landscape of TSP. Meanwhile embedded with chaos theory it can enhance particles' global searching ability so as not to converge to the local optimal solution too quickly, and the introduction of information intercourse can enhance thire local searching ability. Comparing to SA, GA, ACS and so on, this new algorithm shows its validity and satisfactory effect on several benchmark test problems.
引用
收藏
页码：210 / 214
页数：5
相关论文
共 50 条
  • [31] 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
  • [32] A New Hybrid Discrete Firefly Algorithm for Solving the Traveling Salesman Problem
    Mohsen, Abdulqader M.
    Al-Sorori, Wedad
    APPLIED COMPUTING AND INFORMATION TECHNOLOGY, 2017, 695 : 169 - 180
  • [33] 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
  • [34] 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 - +
  • [35] A combination of genetic algorithm and particle swarm optimization method for solving traveling salesman problem
    Borna, Keivan
    Khezri, Razieh
    COGENT MATHEMATICS, 2015, 2
  • [36] A hybrid particle swarm optimization model for the traveling salesman problem
    Machado, TR
    Lopes, HS
    ADAPTIVE AND NATURAL COMPUTING ALGORITHMS, 2005, : 255 - 258
  • [37] Discrete social spider algorithm for the traveling salesman problem
    BAS, Emine
    Ulker, Erkan
    ARTIFICIAL INTELLIGENCE REVIEW, 2021, 54 (02) : 1063 - 1085
  • [38] Discrete orca predation algorithm for the traveling salesman problem
    Kilinç, Hamdi
    İlhan, İlhan
    Neural Computing and Applications, 2024, 36 (36) : 23223 - 23250
  • [39] An Improved Discrete Firefly Algorithm for the Traveling Salesman Problem
    Zhou, Lingyun
    Ding, Lixin
    Qiang, Xiaoli
    Luo, Yihan
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) : 1184 - 1189
  • [40] A discrete state transition algorithm for traveling salesman problem
    Zhou, X.-J. (tiezhongyu2010@gmail.com), 2013, South China University of Technology (30):
12345