Ant Colony Optimization Algorithms

Ant Colony Optimization Algorithms

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.

This algorithm is a member of the ant colony algorithms family, in swarm intelligence methods, and it constitutes some metaheuristic optimizations. Initially proposed by Marco Dorigo in 1992 in his PhD thesis, the first algorithm was aiming to search for an optimal path in a graph, based on the behavior of ants seeking a path between their colony and a source of food. The original idea has since diversified to solve a wider class of numerical problems, and as a result, several problems have emerged, drawing on various aspects of the behavior of ants.

Read more about Ant Colony Optimization Algorithms:  Convergence, Example Pseudo-code and Formulae, Applications, Definition Difficulty, Stigmergy Algorithms, Related Methods, History

Famous quotes containing the words ant and/or colony:

    The owl is abroad, the bat and the toad,
    And so is the cat-a-mountain;
    The ant and the mole sit both in a hole,
    And frog peeps out o’ the fountain.
    Ben Jonson (1572–1637)

    “Tall tales” were told of the sociability of the Texans, one even going so far as to picture a member of the Austin colony forcing a stranger at the point of a gun to visit him.
    —Administration in the State of Texa, U.S. public relief program (1935-1943)