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

Authors

  • Renas Rajab Asaad Nawroz University
  • Nisreen Luqman Abdulnabi University of Duhok

Keywords:

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

Abstract

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.

Published

2018-06-22

How to Cite

Asaad, R., & Abdulnabi, N. (2018). Using Local Searches Algorithms with Ant Colony Optimization for the Solution of TSP Problems. Academic Journal of Nawroz University (AJNU), 7(3). Retrieved from https://journals.nawroz.edu.krd/files/article/view/234

Issue

Section

Articles

Similar Articles

1 2 3 4 5 6 7 8 9 > >> 

You may also start an advanced similarity search for this article.