Title
An artificial bee colony algorithm for the set covering problem
Date Issued
01 January 2014
Access level
metadata only access
Resource Type
conference paper
Author(s)
Cuesta R.
Crawford B.
SOTO DE GIORGIS, RICARDO
Paredes F.
Publisher(s)
Springer Verlag
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.
Start page
53
End page
63
Volume
285
Language
English
OCDE Knowledge area
Matemáticas
Subjects
DOI
10.1007/978-3-319-06740-7_5
Scopus EID
2-s2.0-84923807647
ISBN
9783319067391
Source
Advances in Intelligent Systems and Computing
Resource of which it is part
Advances in Intelligent Systems and Computing
ISSN of the container
21945357
ISBN of the container
978-331906739-1
Conference
3rd Computer Science On-line Conference, CSOC 2014
Sources of information: Directorio de Producción Científica Scopus