Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 189164, 8 pages
Research Article

Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem

1Pontificia Universidad Católica de Valparaíso, 2362807 Valparaíso, Chile
2Universidad Finis Terrae, 7500000 Santiago, Chile
3Universidad Autónoma de Chile, 7500000 Santiago, Chile
4Escuela de Ingeniería Industrial, Universidad Diego Portales, 8370179 Santiago, Chile

Received 20 February 2014; Accepted 30 March 2014; Published 16 April 2014

Academic Editors: S. Balochian and Y. Zhang

Copyright © 2014 Broderick Crawford et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.