An ant-based solver for subset problems

Broderick Crawford, Carlos Castro, Eric Monfroy

Research output: Contribution to conferencePaper

Abstract

Subset Problems are models for many important applications in the field of Operational Research. In this paper, we solve some benchmarks of the Set Partitioning Problem with an Ant-based algorithm using a transition rule with a lookahead mechanism. It 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. © 2009 IEEE.
Original languageEnglish
Pages268-270
Number of pages3
DOIs
Publication statusPublished - 1 Dec 2009
EventACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies -
Duration: 1 Dec 2009 → …

Conference

ConferenceACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies
Period1/12/09 → …

Fingerprint Dive into the research topics of 'An ant-based solver for subset problems'. Together they form a unique fingerprint.

  • Cite this

    Crawford, B., Castro, C., & Monfroy, E. (2009). An ant-based solver for subset problems. 268-270. Paper presented at ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies, . https://doi.org/10.1109/ACT.2009.74