| ID | ||
| Preferred Name |
ant colony optimization |
|
| Synonyms |
ACO ants colony optimization ant colonies optimization ant colony optimizers ant colony optimizations ant colony optimizer |
|
| Definitions |
[Vittorio Maniezzo] Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standard constructive heuristic and by previously constructed solutions... , "[Xiangpei Hu] The Ant Colony Optimization (ACO) is a recent meta-heuristic algorithm for solving hard combinatorial optimization problems. The algorithm, however, has the weaknesses of premature convergence and low search speed, which greatly hinder its application... , "[Enrique Alba] The Ant Colony Optimization (ACO) metaheuristic is a bio-inspired approach for hard combinatorial optimization problems for stationary and non-stationary environments. In the ACO metaheuristic, a colony of artificial ants cooperate for finding high quality solutions in a reasonable time. An interesting example of a non-stationary combinatorial optimization problem is the Multiple Elevators Problem (MEP) which consists in finding a sequence of movements for each elevator to perform in a building so that to minimize, for instance, the users waiting average time... , "[K. Thangavel] Ant Colony Optimization (ACO) metaheuristic is a recent population-based approach inspired by the observation of real ants colony and based upon their collective foraging behavior... , "[Chia Jim Tong] Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good so lutions for combinatorial optimization problems... |
|
| Obsolete |
true |
|
| In Schemes | ||
| Type |
http://www.w3.org/2004/02/skos/core#Concept |
| scopeNote | MS Academic Keywords |
| altLabel | ACO ants colony optimization ant colonies optimization ant colony optimizers ant colony optimizations ant colony optimizer |
| creator | |
| definition | [Vittorio Maniezzo] Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standard constructive heuristic and by previously constructed solutions... , "[Xiangpei Hu] The Ant Colony Optimization (ACO) is a recent meta-heuristic algorithm for solving hard combinatorial optimization problems. The algorithm, however, has the weaknesses of premature convergence and low search speed, which greatly hinder its application... , "[Enrique Alba] The Ant Colony Optimization (ACO) metaheuristic is a bio-inspired approach for hard combinatorial optimization problems for stationary and non-stationary environments. In the ACO metaheuristic, a colony of artificial ants cooperate for finding high quality solutions in a reasonable time. An interesting example of a non-stationary combinatorial optimization problem is the Multiple Elevators Problem (MEP) which consists in finding a sequence of movements for each elevator to perform in a building so that to minimize, for instance, the users waiting average time... , "[K. Thangavel] Ant Colony Optimization (ACO) metaheuristic is a recent population-based approach inspired by the observation of real ants colony and based upon their collective foraging behavior... , "[Chia Jim Tong] Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good so lutions for combinatorial optimization problems... |
| note | Unclear |
| isReplacedBy | |
| prefLabel | ant colony optimization |
| created | 2016-08-03 |
| broader | |
| deprecated | true |
| modified | 2022-03-21 |
| Delete | Subject | Subject Sort | Archive Sort | Author | Type | Created | ||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| No notes to display | ||||||||||||