Paper Details: Downloads: 442
Serial Number: P1110543007
Title: Ant Colony Algorithms in Diverse Combinational Optimization Problems -A Survey
Authors: K.Thangavel and M.Karnan2 and P.Jeganathan and A.Petha lakshmi and R.Sivakumar and G.Geetharamani
Abstract: Ant Colony Optimization (ACO) metaheuristic is a recent population-based approach inspired by the observation of real ants colony and based upon their collective foraging behavior. In ACO, solutions of the problem are constructed within a stochastic iterative process, by adding solution components to partial solutions. Each individual ant constructs a part of the solution using an artificial pheromone, which reflects its experience accumulated while solving the problem, and heuristic information dependent on the problem. In this survey paper, it is intended to summarize the methods of ant colony system used in various types of applications. In particular, routing, assignment, scheduling, subset, machine learning and network routing problems.
Keywords: Combinatorial Optimization, metaheuristics, ant colony system, pheromone.
Journal/Conference: International Journal of Automatic Control and System Engineering
Volume: 6
Issue: 1
Submission Date: 11/1/2005 12:00:00 AM
Review Date: 12/1/2005 12:00:00 AM
Publishing Date: 1/1/2006 12:00:00 AM
Article Downloads: 442
Download:

Facebook