par Blum, Christian 
Référence Computers & operations research, 32, 6, page (1565-1591)
Publication Publié, 2005-06
Référence Computers & operations research, 32, 6, page (1565-1591)
Publication Publié, 2005-06
Article révisé par les pairs
| Résumé : | Ant colony optimization (ACO) is a metaheuristic approach to tackle hard combinatorial optimization problems. The basic component of ACO is a probabilistic solution construction mechanism. Due to its constructive nature, ACO can be regarded as a tree search method. Based on this observation, we hybridize the solution construction mechanism of ACO with beam search, which is a well-known tree search method. We call this approach Beam-ACO. The usefulness of Beam-ACO is demonstrated by its application to open shop scheduling (OSS). We experimentally show that Beam-ACO is a state-of-the-art method for OSS by comparing the obtained results to the best available methods on a wide range of benchmark instances. © 2003 Elsevier Ltd. All rights reserved. |
