Solving TSP problem based on discrete snake optimization algorithm

Yanming Zhang; Xianlong Li

doi:10.1117/12.3026346

27 March 2024 Solving TSP problem based on discrete snake optimization algorithm

Yanming Zhang, Xianlong Li

Proceedings Volume 13105, International Conference on Computer Graphics, Artificial Intelligence, and Data Processing (ICCAID 2023); 131054N (2024) https://doi.org/10.1117/12.3026346
Event: 3rd International Conference on Computer Graphics, Artificial Intelligence, and Data Processing (ICCAID 2023), 2023, Qingdao, China

Abstract

The snake optimization algorithm is a new type of swarm intelligent bionic optimization algorithm that has good optimization effects in solving continuous optimization problems. Based on the discrete TSP problem, the discrete snake optimization algorithm of the traveling salesman problem is studied. First, the discrete coding of the snake optimization algorithm is designed, and then the greedy algorithm is used to initialize the population, and the genetic algorithm is combined with the mating mode of the snake optimization algorithm; the genetic algorithm is improved, including multiple selection strategies and mutation strategies based on population diversity. Finally, the proposed method is tested on 6 benchmark problems of TSPLIB and compared with the test results of other algorithms. Experimental results show that the discrete snake optimization algorithm significantly outperforms other methods on most of the 6 datasets.

(2024) Published by SPIE. Downloading of the abstract is permitted for personal use only.

Citation Download Citation

Yanming Zhang and Xianlong Li "Solving TSP problem based on discrete snake optimization algorithm", Proc. SPIE 13105, International Conference on Computer Graphics, Artificial Intelligence, and Data Processing (ICCAID 2023), 131054N (27 March 2024); https://doi.org/10.1117/12.3026346

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available