Discrete sparrow search algorithm for symmetric traveling salesman problem

The traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics. This paper proposes a swarm intelligence approach using a discrete sparrow search algorithm (DSSA) with a global perturbation strategy to solve the problem. Firstly, the initial solutio...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Applied soft computing Ročník 118; s. 108469
Hlavní autori: Zhang, Zhen, Han, Yang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.03.2022
Predmet:
2-opt
Global perturbation
Sparrow search algorithm
Swarm intelligence
TSP
TSP
Swarm intelligence
Sparrow search algorithm
Global perturbation
2-opt
ISSN:1568-4946, 1872-9681
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics. This paper proposes a swarm intelligence approach using a discrete sparrow search algorithm (DSSA) with a global perturbation strategy to solve the problem. Firstly, the initial solution in the population is generated by the roulette-wheel selection. Secondly, the order-based decoding method is introduced to complete the update of the sparrow position. Then, the global perturbation mechanism combined with Gaussian mutation and swap operator is adopted to balance exploration and exploitation capability. Finally, the 2-opt local search is integrated to further improve the quality of the solution. Those strategies enhance the solution’s quality and accelerate the convergence. Experiments on 34 TSP benchmark datasets are conducted to investigate the performance of the proposed DSSA. And statistical tests are used to verify the significant differences between the proposed DSSA and other state-of-the-art methods. Results show that the proposed method is more competitive and robust in solving the TSP. •A discrete sparrow search algorithm with global disturbance is proposed for symmetric traveling salesman problem.•A novel global disturbance strategy, consisting of Gaussian mutation and swap operator.•The proposed method is compared with classical and state-of-the-art algorithms on TSPLIB.•The numerical results and statistical tests show that the proposed algorithm is more competitive and robust.
ISSN:1568-4946
1872-9681
DOI:10.1016/j.asoc.2022.108469