An ant-based solver for subset problems

Broderick Crawford, Carlos Castro, Eric Monfroy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies
Pages268-270
Number of pages3
DOIs
StatePublished - 2009
Externally publishedYes
EventInternational Conference on Advances in Computing, Control and Telecommunication Technologies, ACT 2009 - Trivandrum, Kerala, India
Duration: 28 Dec 200929 Dec 2009

Publication series

NameACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies

Conference

ConferenceInternational Conference on Advances in Computing, Control and Telecommunication Technologies, ACT 2009
Country/TerritoryIndia
CityTrivandrum, Kerala
Period28/12/0929/12/09

Keywords

  • Ant colony optimization
  • Lookahead techniques
  • Set partitioning problem

Fingerprint

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

Cite this