Improved genetic algorithm for solving traveling salesman problem

Mingming Zhao

doi:10.1117/12.3004164

11 October 2023 Improved genetic algorithm for solving traveling salesman problem

Mingming Zhao

Proceedings Volume 12800, Sixth International Conference on Computer Information Science and Application Technology (CISAT 2023); 128000W (2023) https://doi.org/10.1117/12.3004164
Event: 6th International Conference on Computer Information Science and Application Technology (CISAT 2023), 2023, Hangzhou, China

Abstract

This paper proposes an improved genetic algorithm (IGA) to address the slow and unstable convergence speed of traditional genetic algorithms for solving traveling salesman problems. This algorithm optimizes the initial population through neighborhood search algorithms, designs an adaptive crossover and mutation probability, incorporates the Metropolis criterion to accept inferior solutions with a certain probability, improves the ability to jump out of local optima, and adds reversal operations to enhance local search ability and accelerate population convergence. Using MATLAB, IGA and five other algorithms were tested in the TSPLIB database. The simulation results showed that this algorithm has certain advantages in convergence speed and solution accuracy in small and medium-sized TSP problems.

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

Citation Download Citation

Mingming Zhao "Improved genetic algorithm for solving traveling salesman problem", Proc. SPIE 12800, Sixth International Conference on Computer Information Science and Application Technology (CISAT 2023), 128000W (11 October 2023); https://doi.org/10.1117/12.3004164

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