A new ACO transition rule for set partitioning and covering problems

Broderick Crawford, Carlos Castro, Eric Monfroy

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

6 Citas (Scopus)

Resumen

Set Covering Problem and Set Partitioning Problem are models for many important industrial applications. In this paper, we solve some Operational Research benchmarks with Ant Colony Optimization using a new transition rule. A Lookahead mechanism was incorporated to check constraint consistency in each iteration. Computational results are presented showing the advantages to use this additional mechanism to Ant Colony Optimization.

Idioma originalInglés
Título de la publicación alojadaSoCPaR 2009 - Soft Computing and Pattern Recognition
Páginas426-429
Número de páginas4
DOI
EstadoPublicada - 2009
Publicado de forma externa
EventoInternational Conference on Soft Computing and Pattern Recognition, SoCPaR 2009 - Malacca, Malasia
Duración: 4 dic 20097 dic 2009

Serie de la publicación

NombreSoCPaR 2009 - Soft Computing and Pattern Recognition

Conferencia

ConferenciaInternational Conference on Soft Computing and Pattern Recognition, SoCPaR 2009
País/TerritorioMalasia
CiudadMalacca
Período4/12/097/12/09

Huella

Profundice en los temas de investigación de 'A new ACO transition rule for set partitioning and covering problems'. En conjunto forman una huella única.

Citar esto