1 publication

• Published Subscription 26 Apr 2018

  A Survey on Ant Colony Optimization Algorithm for Travelling Salesman Problem

  By Ranjeet Savita, Pankaj Sharma, Manish Gupta

  Abstract: The ant colony optimization algorithm, abbreviated as ACO, is a meta-heuristic optimization algorithm which is based on the probability for solving different computational problems such as travelling salesman problem (TSP), job scheduling problem, vehicle routing problem etc. This algorithm is a member of ant colony algorithms family in swarm intelligence methods, which is based on the foraging behaviour of real ants. This paper presents a review on a variety of …

  Published in Journal of Image Processing & Pattern Recognition Progress · Vol. 5, Issue 1, 2018 · pp. 33–38 Read article →