Please use this identifier to cite or link to this item:
|Type:||Artigo de evento|
|Title:||Multivariate Ant Colony Optimization In Continuous Search Spaces|
|Author:||De Franca F.O.|
Von Zuben F.J.
De Faissol Attux R.R.
|Abstract:||This work introduces an ant-inspired algorithm for optimization in continuous search spaces that is based on the generation of random vectors with multivariate Gaussian pdf. The proposed approach is called MACACO - Multivariate Ant Colony Algorithm for Continuous Optimization - and is able to simultaneously adapt all the dimensions of the random distribution employed to generate the new individuals at each iteration. In order to analyze MACACO's search efficiency, the approach was compared to a pair of counterparts: the Continuous Ant Colony System (CACS) and the approach known as Ant Colony Optimization in Rn (ACOR). The comparative analysis, which involves wellknown benchmark problems from the literature, has indicated that MACACO outperforms CACS and ACOR in most cases as the quality of the final solution is concerned, and it is just about two times more costly than the least expensive contender. Copyright 2008 ACM.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.