A new ACO transition rule for set partitioning and covering problems

BRODERICK CRAWFORD LABRIN, Carlos Castro, Eric Monfroy

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

6 Scopus citations

Abstract

Set Covering Problem and Set Partitioning Problem are models for many important industrial applications. In this paper, we solve some Operational Research benchmarks with Ant Colony Optimization using a new transition rule. A Lookahead mechanism 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 publicationSoCPaR 2009 - Soft Computing and Pattern Recognition
Pages426-429
Number of pages4
DOIs
StatePublished - 1 Dec 2009
EventInternational Conference on Soft Computing and Pattern Recognition, SoCPaR 2009 - Malacca, Malaysia
Duration: 4 Dec 20097 Dec 2009

Publication series

NameSoCPaR 2009 - Soft Computing and Pattern Recognition

Conference

ConferenceInternational Conference on Soft Computing and Pattern Recognition, SoCPaR 2009
CountryMalaysia
CityMalacca
Period4/12/097/12/09

Keywords

  • Ant colony optimization
  • Lookahead techniques
  • Set covering problem
  • Set partitioning problem

Fingerprint Dive into the research topics of 'A new ACO transition rule for set partitioning and covering problems'. Together they form a unique fingerprint.

Cite this