A Genetic Algorithm With Projection Operator for the Traveling Salesman Problem

2021 ◽  
Author(s):  
Kongxuan Yao ◽  
Weixiang Sun ◽  
Yongchuan Cui ◽  
Luqi He ◽  
Yikai Shao
Keyword(s):  
Genetic Algorithm ◽  
Traveling Salesman Problem ◽  
Projection Operator ◽  
Traveling Salesman ◽  
The Traveling Salesman Problem

scholarly journals A hybrid genetic algorithm for the traveling salesman problem with drone

2019 ◽  
Vol 26 (2) ◽  
pp. 219-247 ◽  
Author(s):  
Quang Minh Ha ◽  
Yves Deville ◽  
Quang Dung Pham ◽  
Minh Hoàng Hà
Keyword(s):  
Genetic Algorithm ◽  
Traveling Salesman Problem ◽  
Hybrid Genetic Algorithm ◽  
Traveling Salesman ◽  
The Traveling Salesman Problem

Application of an Improved Genetic Algorithm with the Search Space Compression in TSP

2013 ◽  
Vol 765-767 ◽  
pp. 687-689
Author(s):  
Yi Song ◽  
Ni Ni Wei
Keyword(s):  
Genetic Algorithm ◽  
Traveling Salesman Problem ◽  
Random Search ◽  
Search Space ◽  
Traveling Salesman ◽  
Improved Genetic Algorithm ◽  
Space Compression ◽  
Accelerate Convergence ◽  
The Traveling Salesman Problem ◽  
Exponential Relation

The Traveling Salesman Problem is a combinatorial optimization problem, the problem has been shown to belong to the NPC problem, the possible solution of Traveling Salesman Problem and the scale of the cities have the exponential relation, so the more bigger of the scale. In this paper, improve the search process of the genetic algorithm by introducing the idea is to compress the search space. The simulation results show that for solving the TSP, the algorithm can quickly obtain multiple high-quality solutions. It can reduce the blindness of random search and accelerate convergence of the algorithm.

Sign in / Sign up

Export Citation Format

Share Document