DocumentCode
2212730
Title
A Brief Review of Ant Algorithms
Author
Cai Shukai ; Jiang Yanbin
Author_Institution
Dept. of Manage., Anhui Univ. of Technol. & Sci., Wuhu, China
fYear
2009
fDate
26-28 Dec. 2009
Firstpage
3917
Lastpage
3921
Abstract
Ant algorithm optimization is a technique for optimization that was introduced in the early 1990´s. The inspiring source of ant colony optimization is the foraging behavior of real ant colonies. It has widely use in discrete optimization problems, to continuous optimization problems. In this article, we give a brief review of the development process of Ant Algorithms, present some of the nowadays best performing ant colony optimization variants. By systematic review the theory of mainstream ant algorithm, we summarizing some important theoretical results. Finally, we propose some theoretic and realistic research points for the ant algorithm.
Keywords
optimisation; ant algorithm optimization; ant colony optimization variants; continuous optimization problems; discrete optimization problems; foraging behavior; Ant colony optimization; Clustering algorithms; Conference management; Distributed computing; Engineering management; Heuristic algorithms; Information science; Roads; Robustness; Technology management;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Science and Engineering (ICISE), 2009 1st International Conference on
Conference_Location
Nanjing
Print_ISBN
978-1-4244-4909-5
Type
conf
DOI
10.1109/ICISE.2009.8
Filename
5454730
Link To Document