Application of the artificial bee colony algorithm for solving the set covering problem

Broderick Crawford, Ricardo Soto, Rodrigo Cuesta, Fernando Paredes

Research output: Contribution to journalArticlepeer-review

50 Scopus citations

Abstract

The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost 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 for the set covering problem.

Original languageEnglish
Article number189164
JournalThe Scientific World Journal
Volume2014
DOIs
StatePublished - 2014
Externally publishedYes

Fingerprint

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

Cite this