Enhancing the transition rule in ant computing for the set covering problem

Broderick Crawford, Carlos Castro, Eric Monfroy

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

Resumen

In this paper, a lookahead mechanism is incorporated in the transition rule of ants solving Set Covering Problem. Computational results are presented showing the advantages to use this additional mechanism to Ant Colony Optimization algorithms.

Idioma originalInglés
Título de la publicación alojadaAnnals of DAAAM for 2009 and Proceedings of the 20th International DAAAM Symposium "Intelligent Manufacturing and Automation
Subtítulo de la publicación alojadaFocus on Theory, Practice and Education"
EditorialDanube Adria Association for Automation and Manufacturing, DAAAM
Páginas1329-1330
Número de páginas2
ISBN (versión impresa)9783901509704
EstadoPublicada - 2009
EventoAnnals of DAAAM for 2009 and 20th International DAAAM Symposium "Intelligent Manufacturing and Automation: Focus on Theory, Practice and Education" - Vienna, Austria
Duración: 25 nov. 200928 nov. 2009

Serie de la publicación

NombreAnnals of DAAAM and Proceedings of the International DAAAM Symposium
ISSN (versión impresa)1726-9679

Conferencia

ConferenciaAnnals of DAAAM for 2009 and 20th International DAAAM Symposium "Intelligent Manufacturing and Automation: Focus on Theory, Practice and Education"
País/TerritorioAustria
CiudadVienna
Período25/11/0928/11/09

Huella

Profundice en los temas de investigación de 'Enhancing the transition rule in ant computing for the set covering problem'. En conjunto forman una huella única.

Citar esto