scholarly journals A Multi-strategy Improved Ant Colony Algorithm for Solving Traveling Salesman Problem

2018 ◽  
Vol 394 ◽  
pp. 042101
Author(s):  
Yanqiu Xiao ◽  
Jianqiang Jiao ◽  
Jie Pei ◽  
Kun Zhou ◽  
Xianchao Yang
Keyword(s):  
Traveling Salesman Problem ◽  
Ant Colony Algorithm ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Improved Ant Colony Algorithm

Improved Ant Colony Algorithm for Optimal Solution TSP

2013 ◽  
Vol 765-767 ◽  
pp. 699-702
Author(s):  
Tian Yuan Zhou
Keyword(s):  
Traveling Salesman Problem ◽  
Ant Colony Algorithm ◽  
Search Strategy ◽  
Optimal Solution ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Algorithm Analysis ◽  
Simulation Testing ◽  
The Traveling Salesman Problem ◽  
Improved Ant Colony Algorithm

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.

scholarly journals Influence of parameters of the ant colony algorithm on the traveling salesman problem solution

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

scholarly journals U-Turning Ant Colony Algorithm for Solving Symmetric Traveling Salesman Problem

2018 ◽  
Vol 7 (4) ◽  
pp. 45
Author(s):  
Saman M. Almufti ◽  
Awaz A. Shaban
Keyword(s):  
Ant Colony Optimization ◽  
Traveling Salesman Problem ◽  
Ant Colony Algorithm ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Initial State ◽  
Science Field ◽  
Np Hard Problem ◽  
Symmetric Traveling Salesman Problem

This paper provides a new Ant based algorithms called U-Turning Ant colony optimization (U-TACO) for solving a well-known NP-Hard problem, which is widely used in computer science field called Traveling Salesman Problem (TSP). Generally U-Turning Ant colony Optimization Algorithm makes a partial tour as an initial state for the basic conventional Ant Colony algorithm. This paper provides tables and charts for the results obtained by U-Turning Ant colony Optimization for various TSP problems from the TSPLIB95.

Sign in / Sign up

Export Citation Format

Share Document