par Socha, Krzysztof 
Référence Lecture notes in computer science, 3172 LNCS, page (25-36)
Publication Publié, 2004
Référence Lecture notes in computer science, 3172 LNCS, page (25-36)
Publication Publié, 2004
Article révisé par les pairs
| Résumé : | This paper presents how the Ant Colony Optimization (ACO) metaheuristic can be extended to continuous search domains and applied to both continuous and mixed discrete-continuous optimization problems. The paper describes the general underlying idea, enumerates some possible design choices, presents a first implementation, and provides some preliminary results obtained on well-known benchmark problems. The proposed method is compared to other ant, as well as non-ant methods for continuous optimization. © 2004 Springer-Verlag. |
