U-Turning Ant Colony Algorithm for Solving Symmetric Traveling Salesman Problem
Keywords:
Traveling Salesman Problem (TSP), Ant System (AS), Swarm Intelligence, U-Turning Ant Colony Optimization Algorithm (U-TACO), Symmetric Traveling Salesman Problem (STSP)Abstract
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.
Downloads
Published
2018-12-21
How to Cite
M. Almufti, S., & A. Shaban, A. (2018). U-Turning Ant Colony Algorithm for Solving Symmetric Traveling Salesman Problem. Academic Journal of Nawroz University (AJNU), 7(4). Retrieved from https://journals.nawroz.edu.krd/files/article/view/351
Issue
Section
Articles
