Ant colony optimization: Introduction and recent trends

被引:734
作者
Blum, Christian [1 ]
机构
[1] Univ Politecn Cataluna, LSI, ALBCOM, Barcelona 08034, Spain
关键词
ant colony optimization; discrete optimization; hybridization;
D O I
10.1016/j.plrev.2005.10.001
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Ant colony optimisation 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. This behavior is exploited in artificial ant colonies for the search of approximate solutions to discrete optimization problems, to continuous optimization problems, and to important problems in telecommunications. such as routing and load balancing. First, we deal with the biological inspiration of ant colony optimization algorithms. We show how this biological inspiration can be transfered into an algorithm for discrete optimization. Then, we outline ant colony optimization in more general terms in the context of discrete optimization, and present some of the nowadays best-performing ant colon) optimization variants. After summarizing some important theoretical results, we demonstrate how ant colony optimization can be applied to continuous optimization problems. Finally, we provide examples of an interesting recent research direction: The hybridization with more classical techniques from artificial intelligence and operations research. (C) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:353 / 373
页数:21
相关论文
共 97 条
[1]   Ant colony system application to macrocell overlap removal [J].
Alupoaei, S ;
Katkoori, S .
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2004, 12 (10) :1118-1122
[2]  
[Anonymous], 2004, Ant colony optimization
[3]  
[Anonymous], 2002, HDB METAHEURISTICS
[4]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[5]  
[Anonymous], 1993, ESSENTIALS ARTIFICIA
[6]  
[Anonymous], 2002, International Workshop on Ant Algorithms
[7]  
[Anonymous], 2002, ANT ALGORITHMS, DOI DOI 10.1007/3-540-45724-0_16
[8]  
Bautista J., 2002, Ant Algorithms: 3rd International Workshop, ANTS 2002, P65
[9]   Rollout Algorithms for Combinatorial Optimization [J].
Bertsekas D.P. ;
Tsitsiklis J.N. ;
Wu C. .
Journal of Heuristics, 1997, 3 (3) :245-262
[10]  
Bianchi L., 2002, LECT NOTES COMPUTER, V2439, P883