Comparative Analysis of Genetic Algorithm and Ant Colony Algorithm on Solving Traveling Salesman Problem

Author(s):  
Kangshun Li ◽  
Lanlan Kang ◽  
Wensheng Zhang ◽  
Bing Li
2013 ◽  
Vol 765-767 ◽  
pp. 699-702
Author(s):  
Tian Yuan Zhou

Based on the ant colony algorithm analysis and research, this paper proposed an improved ant colony algorithm. Through updating pheromone and optimal search strategy, then applied to the Traveling Salesman Problem (TSP), effectively improved the searching capability of the algorithm. Finally through the simulation testing and analysis, verified that the improved ant colony algorithm is effective, and has good performance.


2014 ◽  
Vol 4 (4(70)) ◽  
pp. 18
Author(s):  
Ігор Андрійович Могила ◽  
Ірина Іванівна Лобач ◽  
Оксана Андріївна Якимець

1998 ◽  
Vol 01 (02n03) ◽  
pp. 149-159 ◽  
Author(s):  
Hozefa M. Botee ◽  
Eric Bonabeau

Ant Colony Optimization (ACO) is a promising new approach to combinatorial optimization. Here ACO is applied to the traveling salesman problem (TSP). Using a genetic algorithm (GA) to find the best set of parameters, we demonstrate the good performance of ACO in finding good solutions to the TSP.


Sign in / Sign up

Export Citation Format

Share Document