作者: Krzysztof Socha
DOI: 10.1007/978-3-540-28646-2_3
关键词:
摘要: This paper presents how the Ant Colony Optimization (ACO) metaheuristic can be extended to continuous search domains and applied both mixed discrete-continuous optimization problems. The describes general underlying idea, enumerates some possible design choices, a first implementation, provides preliminary results obtained on well-known benchmark proposed method is compared other ant, as well non-ant methods for optimization.