An artificial bee colony algorithm for the set covering problem

Rodrigo Cuesta, Broderick Crawford, Ricardo Soto, Fernando Paredes

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

14 Scopus citations

Abstract

In this paper, we present a new Artificial Bee Colony algorithm to solve the non-unicost Set Covering Problem. The Artificial Bee Colony algorithm is a recent metaheuristic technique based on the intelligent foraging behavior of honey bee swarm. Computational results show that Artificial Bee Colony algorithm is competitive in terms of solution quality with other metaheuristic approaches for the Set Covering Problem problem.

Original languageEnglish
Title of host publicationModern Trends and Techniques in Computer Science - 3rd Computer Science On-line Conference, CSOC 2014
EditorsRadek Silhavy, Roman Senkerik, Zuzana Kominkova Oplatkova, Petr Silhavy, Zdenka Prokopova
PublisherSpringer Verlag
Pages53-63
Number of pages11
ISBN (Electronic)9783319067391
DOIs
StatePublished - 2014
Externally publishedYes
Event3rd Computer Science On-line Conference, CSOC 2014 -
Duration: 1 Apr 2014 → …

Publication series

NameAdvances in Intelligent Systems and Computing
Volume285
ISSN (Print)2194-5357

Conference

Conference3rd Computer Science On-line Conference, CSOC 2014
Period1/04/14 → …

Keywords

  • Artificial bee colony algorithm
  • Combinatorial optimization
  • Heuristic
  • Set covering problem

Fingerprint

Dive into the research topics of 'An artificial bee colony algorithm for the set covering problem'. Together they form a unique fingerprint.

Cite this