A New Method Based on Genetic Algorithms for Solving Traveling Salesman Problem

2009 ◽  
Author(s):  
Farshad Frahadnia
Keyword(s):  
Genetic Algorithms ◽  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
New Method

A novel ODV crossover operator-based genetic algorithms for traveling salesman problem

2020 ◽  
Vol 24 (17) ◽  
pp. 12855-12885 ◽  
Author(s):  
P. Victer Paul ◽  
C. Ganeshkumar ◽  
P. Dhavachelvan ◽  
R. Baskaran
Keyword(s):  
Genetic Algorithms ◽  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Crossover Operator

The Algorithm Animation of Genetic Algorithm of Travelling Salesman Problem

2013 ◽  
Vol 411-414 ◽  
pp. 2013-2016 ◽  
Author(s):  
Guo Zhi Wen
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Traveling Salesman Problem ◽  
Travelling Salesman Problem ◽  
Traveling Salesman ◽  
Travelling Salesman ◽  
Algorithm Animation ◽  
The Traveling Salesman Problem

The traveling salesman problem is analyzed with genetic algorithms. The best route map and tendency of optimal grade of 500 cities before the first mutation, best route map after 15 times of mutation and tendency of optimal grade of the final mutation are displayed with algorithm animation. The optimal grade is about 0.0455266 for the best route map before the first mutation, but is raised to about 0.058241 for the 15 times of mutation. It shows that through the improvements of algorithms and coding methods, the efficiency to solve the traveling problem can be raised with genetic algorithms.

Sign in / Sign up

Export Citation Format

Share Document