蚁群优化算法(ACO)是一种受真实蚂蚁群体行为启发的人工智能系统，用于解决离散优化问题。该算法由Marco Dorigo等人于1992年提出，并首次应用于旅行商问题(TSP)和二次分配问题(QAP)。此后，研究人员提出了多种改进版本，如Ant Colony System (ACS) 和 MAX-MIN Ant System (MMAS)，并在TSP等问题上取得了优异成果。
Ant Colony Optimization (ACO) studies artificial systems that take inspiration from the behavior of real ant colonies and which are used to solve discrete optimization problems. In 1999, the Ant Colony Optimization metaheuristic was defined by Dorigo, Di Caro and Gambardella (see papers on the ACO metaheuristic).
The first ACO system was introduced by Marco Dorigo in his Ph.D. thesis (1992), and was called Ant System (AS). AS is the result of a research on computational intelligence approaches to combinatorial optimization that Dorigo conducted at Politecnico di Milano in collaboration with Alberto Colorni and Vittorio Maniezzo. AS was initially applied to the travelling salesman problem (see papers on the TSP), and to the quadratic assignment problem (see papers on the QAP).
Since 1995 Dorigo, Gambardella and Stützle have been working on various extended versions of the AS paradigm. Dorigo and Gambardella have proposed Ant Colony System (ACS), while Stützle and Hoos have proposed MAX-MIN Ant System (MMAS). They have both have been applied to the symmetric and asymmetric travelling salesman problem (see papers on the TSP), with excellent results. Dorigo, Gambardella and Stützle have also proposed new hybrid versions of ant colony optimization with local search. In problems like the quadratic assignment problem and the sequential ordering problem these ACO algorithms outperform all known algorithms on vast classes of benchmark problems.
For a nice introduction to the field see the March 2000 issue of Scientific American or the recent paper titled "Inspiration for Optimization from Social Insect Behavior" appeared on July 6, 2000, in Nature.
The recent book "Ant Colony Optimization" (Dorigo and Stützle, 2004) gives a full overview of the many successful applications of Ant Colony Optimization.
扫一扫
1万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
