Discrete Salp Swarm Algorithm for Euclidean Travelling Salesman Problem

被引:5
|
作者
Panwar, Karuna [1 ]
Deep, Kusum [1 ]
机构
[1] Indian Inst Technol Roorkee, Dept Math, Roorkee, Uttar Pradesh, India
关键词
Salp swarm algorithm; Travelling salesman problem; Combinatorial optimization problem; Metaheuristics; 2-opt algorithm; SEARCH ALGORITHM; OPTIMIZATION; ASSIGNMENT; BRANCH; MEMORY;
D O I
10.1007/s10489-022-03976-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Salp Swarm Algorithm (SSA) is one of the recently proposed swarm intelligence-based algorithms, which finds its motivation in the swarming behaviour of salps when navigating and foraging in the ocean. The SSA is essentially derived to solve optimization problems that have continuous search space. SSA is a simple to implement and competitive algorithm that has been proven helpful in a variety of real-world applications. It has been explored over several optimization problems so far. In this study, an enhanced discrete version of SSA is proposed to solve the Travelling Salesman Problem (TSP). As TSP is a combinatorial optimization problem, the classical SSA is modified using swap, shift and symmetry operators for global exploration and local exploitation. Also, the 2-opt method has been incorporated with the proposed algorithm to improve the local search ability of the algorithm while addressing discrete problems. The proposed Discrete Salp Swarm Algorithm (DSSA) has evaluated over 45 TSP instances, and the computational results showed that it is a promising algorithm. To assess its performance, the proposed algorithm's results are compared with well-known algorithms such as Genetic Algorithm, Artificial Bee Colony, Spider Monkey Algorithm, Jaya Algorithm, Black Hole, Symbiotic Organism Search etc. The proposed algorithm significantly outperformed these algorithms for a majority of TSP instances.
引用
收藏
页码:11420 / 11438
页数:19
相关论文
共 50 条
  • [1] Discrete Salp Swarm Algorithm for Euclidean Travelling Salesman Problem
    Karuna Panwar
    Kusum Deep
    [J]. Applied Intelligence, 2023, 53 : 11420 - 11438
  • [2] Discrete Salp Swarm Algorithm for symmetric traveling salesman problem
    Chen, Peng
    Liu, Ming
    Zhou, Shihua
    [J]. MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2023, 20 (05) : 8856 - 8874
  • [3] Discrete Swallow Swarm Optimization algorithm for Travelling Salesman Problem
    Bouzidi, Safaa
    Riff, Mohammed Essaid
    [J]. 2017 INTERNATIONAL CONFERENCE ON SMART DIGITAL ENVIRONMENT (ICSDE'17), 2017, : 80 - 84
  • [4] A discrete particle swarm optimization algorithm for travelling salesman problem
    Shi, X. H.
    Zhou, Y.
    Wang, L. M.
    Wang, Q. X.
    Liang, Y. C.
    [J]. COMPUTATIONAL METHODS, PTS 1 AND 2, 2006, : 1063 - +
  • [5] A hybrid swarm intelligence algorithm for the travelling salesman problem
    Kuo, I-Hong
    Horng, Shi-Jinn
    Kao, Tzong-Wann
    Lin, Tsung-Lieh
    Lee, Cheng-Ling
    Chen, Yuan-Hsin
    Pan, Y. I.
    Terano, Takao
    [J]. EXPERT SYSTEMS, 2010, 27 (03) : 166 - 179
  • [6] Evolutionary Discrete Firefly Algorithm for Travelling Salesman Problem
    Jati, Gilang Kusuma
    Suyanto
    [J]. ADAPTIVE AND INTELLIGENT SYSTEMS, 2011, 6943 : 393 - 403
  • [7] Discrete cuckoo search algorithm for the travelling salesman problem
    Aziz Ouaarab
    Belaïd Ahiod
    Xin-She Yang
    [J]. Neural Computing and Applications, 2014, 24 : 1659 - 1669
  • [8] Discrete cuckoo search algorithm for the travelling salesman problem
    Ouaarab, Aziz
    Ahiod, Belaid
    Yang, Xin-She
    [J]. NEURAL COMPUTING & APPLICATIONS, 2014, 24 (7-8): : 1659 - 1669
  • [9] An Improved Particle Swarm Optimization Algorithm for the Travelling Salesman Problem
    Ahmed, A. K. M. Foysal
    Sun, Ji Ung
    [J]. ADVANCED SCIENCE LETTERS, 2016, 22 (11) : 3318 - 3322
  • [10] A Novel Discrete Particle Swarm Optimization Algorithm for the Travelling Salesman Problems
    Sequeiros, Jose A.
    Silva, Rui
    Santos, Andre S.
    Bastos, J.
    Varela, M. L. R.
    Madureira, A. M.
    [J]. INNOVATIONS IN INDUSTRIAL ENGINEERING, 2022, : 48 - 55