Constraint programming can help ants solving highly constrainted combinatorial problems

Broderick Crawford, Carlos Castro, Eric Monfroy

Research output: Contribution to conferencePaper

1 Citation (Scopus)

Abstract

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.
Original languageEnglish
Pages380-383
Number of pages4
Publication statusPublished - 1 Jan 2008
EventICSOFT 2008 - Proceedings of the 3rd International Conference on Software and Data Technologies -
Duration: 1 Jan 2008 → …

Conference

ConferenceICSOFT 2008 - Proceedings of the 3rd International Conference on Software and Data Technologies
Period1/01/08 → …

Fingerprint Dive into the research topics of 'Constraint programming can help ants solving highly constrainted combinatorial problems'. Together they form a unique fingerprint.

  • Cite this

    Castro, C., & Monfroy, E. (2008). Constraint programming can help ants solving highly constrainted combinatorial problems. 380-383. Paper presented at ICSOFT 2008 - Proceedings of the 3rd International Conference on Software and Data Technologies, .