A hybrid Ant algorithm for the set covering problem

Broderick Crawford, Ricardo Soto, Eric Monfroy, Fernando Paredes, Wenceslao Palma

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

15 Citas (Scopus)

Resumen

Set covering problem is the model for many important industrial applications. In this paper, we solve some benchmarks of this problem with ant colony optimization algorithms using a new transition rule. A look-ahead mechanism was incorporated to check constraint consistency in ant computing. Computational results are presented showing the advantages to use this additional mechanism to ant system and ant colony system.

Idioma originalInglés
Páginas (desde-hasta)4667-4673
Número de páginas7
PublicaciónInternational Journal of Physical Sciences
Volumen6
N.º19
EstadoPublicada - 16 sept. 2011
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'A hybrid Ant algorithm for the set covering problem'. En conjunto forman una huella única.

Citar esto