Constraint programming can help ants solving highly constrainted combinatorial 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

1 Cita (Scopus)

Resumen

In this paper, we focus on the resolution of Set Partitioning Problem. We try to solve it with Ant Colony Optimization algorithms and Hybridizations of Ant Colony Optimization with Constraint Programming techniques. We recognize the difficulties of pure Ant Algorithms solving strongly constrained problems. Therefore, we explore the addition of Constraint Programming mechanisms in the construction phase of the ants so they can complete their solutions. Computational results solving some test instances are presented showing the advantages to use this kind of hybridization.

Idioma originalInglés
Título de la publicación alojadaICSOFT 2008 - Proceedings of the 3rd International Conference on Software and Data Technologies
EditorialInst. for Syst. and Technol. of Inf., Control and Commun. (INSTICC)
Páginas380-383
Número de páginas4
ISBN (versión impresa)9789898111517
EstadoPublicada - 2008
Publicado de forma externa
EventoICSOFT 2008 - 3rd International Conference on Software and Data Technologies - Porto, Portugal
Duración: 5 jul. 20088 jul. 2008

Serie de la publicación

NombreICSOFT 2008 - Proceedings of the 3rd International Conference on Software and Data Technologies
VolumenPL/DPS/KE

Conferencia

ConferenciaICSOFT 2008 - 3rd International Conference on Software and Data Technologies
País/TerritorioPortugal
CiudadPorto
Período5/07/088/07/08

Huella

Profundice en los temas de investigación de 'Constraint programming can help ants solving highly constrainted combinatorial problems'. En conjunto forman una huella única.

Citar esto