An Improved Hybrid Discrete Particle Swarm Optimization Algorithm to Solve the TSP Problem

被引：1

作者：

Xiao Bin ^{[1
]}

Li Zhaohui ^{[1
]}

机构：

[1] Beijing Univ Posts & Telecommun, Sch Software, Beijing, Peoples R China

来源：

MECHANICAL AND ELECTRONICS ENGINEERING III, PTS 1-5 | 2012年 / 130-134卷

关键词：

Hybrid Discrete Swarm Optimization; TSP Problem; Simulated Annealing;

D O I：

10.4028/www.scientific.net/AMM.130-134.3589

中图分类号：

TH [机械、仪表工业];

学科分类号：

0802 ;

摘要：

Through investigating the issue of solving the TSP problem by discrete particle swarm optimization algorithm, this study finds a new discrete particle swarm optimization algorithm (NDPSO), which is easy to combine with other algorithm and has fast convergence and high accuracy, by introducing the thought of the greedy algorithm and GA algorithm and refining the discrete particle swarm optimization algorithm. And then the study expands NDPSO by Simulated Annealing algorithm and proposes a hybrid discrete particle swarm optimization algorithm (HDPSO). At last, the experiments prove that these two algorithms both have good convergence, but the HDPSO has a better capacity to find the best solution.

引用

页码：3589 / 3594

页数：6

共 50 条

[1] An improved discrete particle swarm optimization algorithm for TSP
Zhang, Changsheng
Sun, Jigui
Wang, Yan
Yang, Qingyun
[J]. PROCEEDING OF THE 2007 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY, WORKSHOPS, 2007, : 35 - +
[2] Discrete Novel Hybrid Particle Swarm Optimization To Solve Travelling Salesman Problem
Bouzidi, Morad
Essaid Riffi, Mohammed
[J]. 2014 5TH WORKSHOP ON CODES, CRYPTOGRAPHY AND COMMUNICATION SYSTEMS (WCCCS' 14), 2014, : 17 - 20
[3] A hybrid discrete particle swarm optimization algorithm to solve flow shop scheduling problems
Chandrasekaran, S.
Ponnambalam, S. G.
Suresh, R. K.
Vijayakumar, N.
[J]. 2006 IEEE CONFERENCE ON CYBERNETICS AND INTELLIGENT SYSTEMS, VOLS 1 AND 2, 2006, : 528 - +
[4] Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
Chen A.-L.
Yang G.-K.
Wu Z.-M.
[J]. Journal of Zhejiang University-SCIENCE A, 2006, 7 (4): : 607 - 614
[5] Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
CHEN Ai-ling
[J]. Journal of Zhejiang University-Science A(Applied Physics & Engineering), 2006, (04) : 607 - 614
[6] Velocity Tentative Particle Swarm Optimization to Solve TSP
Akhand, M. A. H.
Akter, Shahina
Rashid, M. A.
[J]. 2013 INTERNATIONAL CONFERENCE ON ELECTRICAL INFORMATION AND COMMUNICATION TECHNOLOGY (EICT), 2013,
[7] Novel discrete Particle Swarm Optimization to solve Traveling Salesman Problem
Zhong, Wen-liang
Zhang, Jun
Chen, Wei-neng
[J]. 2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 3283 - 3287
[8] An Enhanced Swap Sequence-Based Particle Swarm Optimization Algorithm to Solve TSP
Emambocus, Bibi Aamirah Shafaa
Jasser, Muhammed Basheer
Hamzah, Muzaffar
Mustapha, Aida
Amphawan, Angela
[J]. IEEE ACCESS, 2021, 9 : 164820 - 164836
[9] Research on Location Routing Problem based on improved discrete Particle Swarm Optimization algorithm
Peng, Yang
Wu, Chenjian
[J]. PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON INTELLIGENT LOGISTICS SYSTEMS, 2008, : 491 - 497
[10] An Improved Discrete Particle Swarm Optimization Algorithm for the Capacitated p-Median Problem
Wang, Zhurong
Yi, Zhenzhen
Hei, Xinhong
Wang, Zhanmin
[J]. 2017 13TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY (ICNC-FSKD), 2017, : 254 - 258

← 1 2 3 4 5 →