In this paper, the authors propose the use of the Levy probability distribution as leading mechanism for solutions differentiation in an efficient and bio-inspired optimization algorithm, ant colony optimization in continuous domains, ACOR. In the classical ACOR, new solutions are constructed starting from one solution, selected from an archive, where Gaussian distribution is used for parameter diversification. In the proposed approach, the Levy probability distributions are properly introduced in the solution construction step, in order to couple the ACOR algorithm with the exploration properties of the Levy distribution.
Candela, R., Riva Sanseverino, E., Fileccia Scimemi, G., Cottone, G. (2009). Lévy Flights for Ant Colony Optimization in Continuous Domains. In Mathematical Theory and Computational Practice, Fifth Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009, Abstract Booklet, University of Heidelberg. (pp.79-88). Heidelberg : Heidelberg university.
Lévy Flights for Ant Colony Optimization in Continuous Domains
CANDELA, Roberto;RIVA SANSEVERINO, Eleonora;FILECCIA SCIMEMI, Giuseppe;COTTONE, Giulio
2009-01-01
Abstract
In this paper, the authors propose the use of the Levy probability distribution as leading mechanism for solutions differentiation in an efficient and bio-inspired optimization algorithm, ant colony optimization in continuous domains, ACOR. In the classical ACOR, new solutions are constructed starting from one solution, selected from an archive, where Gaussian distribution is used for parameter diversification. In the proposed approach, the Levy probability distributions are properly introduced in the solution construction step, in order to couple the ACOR algorithm with the exploration properties of the Levy distribution.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
