Enhancing the transition rule in ant computing for the set covering problem

BRODERICK CRAWFORD LABRIN, Carlos Castro, Eric Monfroy

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

Abstract

In this paper, a lookahead mechanism is incorporated in the transition rule of ants solving Set Covering Problem. Computational results are presented showing the advantages to use this additional mechanism to Ant Colony Optimization algorithms.

Original languageEnglish
Title of host publicationAnnals of DAAAM for 2009 and Proceedings of the 20th International DAAAM Symposium "Intelligent Manufacturing and Automation
Subtitle of host publicationFocus on Theory, Practice and Education"
PublisherDanube Adria Association for Automation and Manufacturing, DAAAM
Pages1329-1330
Number of pages2
ISBN (Print)9783901509704
StatePublished - 1 Jan 2009
EventAnnals of DAAAM for 2009 and 20th International DAAAM Symposium "Intelligent Manufacturing and Automation: Focus on Theory, Practice and Education" - Vienna, Austria
Duration: 25 Nov 200928 Nov 2009

Publication series

NameAnnals of DAAAM and Proceedings of the International DAAAM Symposium
ISSN (Print)1726-9679

Conference

ConferenceAnnals of DAAAM for 2009 and 20th International DAAAM Symposium "Intelligent Manufacturing and Automation: Focus on Theory, Practice and Education"
CountryAustria
CityVienna
Period25/11/0928/11/09

Keywords

  • Ant colony optimization
  • Constraint programming
  • Lookahead techniques
  • Set covering problems
  • Set partitioning problems

Fingerprint Dive into the research topics of 'Enhancing the transition rule in ant computing for the set covering problem'. Together they form a unique fingerprint.

Cite this