Using Local Searches Algorithms with Ant Colony Optimization for the Solution of TSP Problems


  • Renas Rajab Asaad Department of Computer Science, Nawroz University, Duhok, Kurdistan Region - Iraq
  • Nisreen Luqman Abdulnabi Faculty of Economics, University of Duhok, Duhok, Kurdisatn Region - Iraq



Travels Salesman Problem (TSP), Ant Colony Algorithm (ACO), Great Deluge Algorithm, Optimization, Opt algorithm


Swarm intelligence is a relatively new approach to problem solving that takes inspiration from the social behaviors of insects and other animals. Ants, in particular, have inspired a number of methods and techniques among which the most studied and successful is the general-purpose optimization technique, also known as ant colony optimization, In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs.  Ant Colony Optimization (ACO) algorithm is used to arrive at the best solution for TSP. In this article, the researcher has introduced ways to use a great deluge algorithm with the ACO algorithm to increase the ability of the ACO in finding the best tour (optimal tour). Results are given for different TSP problems by using ACO with great deluge and other local search algorithms.


Download data is not yet available.


Almufti, Saman Mohammed. (2015), "U-Turning Ant Colony Algorithm powered by Great Deluge Algorithm for the solution of TSP Problem.".

Marco Dorigo, Thomas Stu¨ tzle”, (2004), Ant Colony Optimization

Federico Greco, (2008), Travelling Salesman Problem

J. Basic. Appl. Sci. Res., 2(3)2336-2341, (2012), A New Hybrid Algorithm for Optimization Using PSO and GDA

D. Karapetyan, G. Gutin, (2012), Efficient Local Search Algorithms for Known and New Neighborhoods for the Generalized Traveling Salesman Problem

Andrej Kazakov, (2009), Travelling Salesman Problem : Local Search and Divide and Conquer working together

Alfonsas misevičius, armantas ostreika, antanas šimaitis, vilius žilevičius, (2007), vol.36, no.2, improving local search for the traveling salesman problem.

Almufti, S. Mohammed (2017), " Using Swarm Intelligence for solving NP-Hard Problems", Academic Journal of Nawroz University, doi

( https :// ).



How to Cite

Rajab Asaad, R., & Luqman 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.




Most read articles by the same author(s)