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

  • Asaad R
  • et al.
N/ACitations
Citations of this article
11Readers
Mendeley users who have this article in their library.

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 co lony 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 a re given for different TSP problems by using ACO with great deluge and other local search algorithms.

Cite

CITATION STYLE

APA

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. https://doi.org/10.25007/ajnu.v7n3a193

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free