Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem

Broderick Crawford, Ricardo Soto, Rodrigo Cuesta, Fernando Paredes

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

10 Scopus citations


The Weighted Set Covering Problem is a formal model for many practical optimization problems. In this problem the goal is to choose a subset of columns of minimal cost covering every row. Here, we present a novel application of the Artificial Bee Colony algorithm to solve the Weighted Set Covering Problem. The Artificial Bee Colony algorithm is a recent Swarm Metaheuristic technique based on the intelligent foraging behavior of honey bees. Experimental results show that our Artificial Bee Colony algorithm is competitive in terms of solution quality with other recent metaheuristic approaches.

Original languageEnglish
Title of host publicationHCI International 2014 - Posters' Extended Abstracts - International Conference, HCI International 2014, Proceedings
PublisherSpringer Verlag
Number of pages5
ISBN (Print)9783319078564
StatePublished - 2014

Publication series

NameCommunications in Computer and Information Science
Volume434 PART I
ISSN (Print)1865-0929


  • Artificial Bee Colony Algorithm
  • Swarm Intelligence
  • Weighted Set Covering Problem


Dive into the research topics of 'Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem'. Together they form a unique fingerprint.

Cite this