An Experimental Study of the Simple Ant Colony Optimization Algorithm
Marco Dorigo, Thomas Stützle, Nikos E. Mastorakis · 2001
Abstract:- Ant Colony Optimization (ACO) is a recently proposed metaheuristic inspired by the foraging behavior of ant colonies. Although it has been experimentally shown to be highly effective on a number of static and dynamic discrete optimization problems, only limited knowl-edge is available to explain why the metaheuristic is so successful. In this paper we propose a simple framework that allows the investigation of some basic properties of ACO and we report about some experiments and what we learned from them. Key-Words:- Ant Colony Optimization, Simple-ACO algorithm, shortest path problem 1