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


  • Saman M. Almufti Department of Computer Science, Nawroz University, Duhok, Kurdistan Region - Iraq
  • Awaz A. Shaban Gara Institute,Duhok, Kurdistan Region - Iraq




Traveling Salesman Problem (TSP), Ant System (AS), Swarm Intelligence, U-Turning Ant Colony Optimization Algorithm (U-TACO), Symmetric Traveling Salesman Problem (STSP)


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.


Download data is not yet available.


Almufti, S. (2015). U-Turning Ant Colony Algorithm powered by Great Deluge Algorithm for the solution of TSP Problem. [online] Hdl.handle.net. Available at: http://hdl.handle.net/11129/1734 [Accessed 5 Aug. 2018].
Almufti, S. (2017). Using Swarm Intelligence for solving NPHard Problems. Academic Journal of Nawroz University, 6(3), pp. 46-50. doi:10.25007/ajnu.v6n3a78
Andrej Kazakov, (2009), Travelling Salesman Problem: Local Search and Divide and Conquer working together
Asaad, R., Abdulnabi, N. (2018). Using Local Searches Algorithms with Ant Colony Optimization for the Solution of TSP Problems. Academic Journal Of Nawroz University, 7(3), 1-6. doi:10.25007/ajnu.v7n3a193
Dorigo, M. (1992). Optimization, Learning and Natural Algorithms, PhD thesis, Politecnico di Milano, Italy.
Federico Greco, (2008), Travelling Salesman Problem .
Mute-net.sourceforge.net, (2015). MUTE: Simple, Anonymous File Sharing. [online] Available at: http://mute-net.sourceforge.net/howAnts.shtml [Accessed 20 July. 2018] .



How to Cite

Almufti, S. M., & Shaban, A. A. (2018). U-Turning Ant Colony Algorithm for Solving Symmetric Traveling Salesman Problem. Academic Journal of Nawroz University, 7(4), 45–49. https://doi.org/10.25007/ajnu.v7n4a270