An artificial bee colony algorithm for the set covering problem

16Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Cuesta, R., Crawford, B., Soto, R., & Paredes, F. (2014). An artificial bee colony algorithm for the set covering problem. In Advances in Intelligent Systems and Computing (Vol. 285, pp. 53–63). Springer Verlag. https://doi.org/10.1007/978-3-319-06740-7_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free