An artificial bee colony algorithm for the set covering problem

Rodrigo Cuesta; BRODERICK   CRAWFORD LABRIN; RICARDO JAVIER SOTO DE GIORGIS; Fernando Paredes

doi:10.1007/978-3-319-06740-7_5

An artificial bee colony algorithm for the set covering problem

Rodrigo Cuesta, BRODERICK CRAWFORD LABRIN, RICARDO JAVIER SOTO DE GIORGIS, Fernando Paredes

SCHOOL OF COMPUTER ENGINEERING

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

14 Scopus citations

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.

Original language	English
Title of host publication	Modern Trends and Techniques in Computer Science - 3rd Computer Science On-line Conference, CSOC 2014
Editors	Radek Silhavy, Roman Senkerik, Zuzana Kominkova Oplatkova, Petr Silhavy, Zdenka Prokopova
Publisher	Springer Verlag
Pages	53-63
Number of pages	11
ISBN (Electronic)	9783319067391
DOIs	https://doi.org/10.1007/978-3-319-06740-7_5
State	Published - 1 Jan 2014
Event	3rd Computer Science On-line Conference, CSOC 2014 - Duration: 1 Apr 2014 → …

Publication series

Name	Advances in Intelligent Systems and Computing
Volume	285
ISSN (Print)	2194-5357

Conference

Conference	3rd Computer Science On-line Conference, CSOC 2014
Period	1/04/14 → …

Keywords

Artificial bee colony algorithm
Combinatorial optimization
Heuristic
Set covering problem

Access to Document

10.1007/978-3-319-06740-7_5

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

Cite this

Cuesta, R., CRAWFORD LABRIN, BRODERICK., SOTO DE GIORGIS, RICARDO. JAVIER., & Paredes, F. (2014). An artificial bee colony algorithm for the set covering problem. In R. Silhavy, R. Senkerik, Z. K. Oplatkova, P. Silhavy, & Z. Prokopova (Eds.), Modern Trends and Techniques in Computer Science - 3rd Computer Science On-line Conference, CSOC 2014 (pp. 53-63). (Advances in Intelligent Systems and Computing; Vol. 285). Springer Verlag. https://doi.org/10.1007/978-3-319-06740-7_5

Cuesta, Rodrigo ; CRAWFORD LABRIN, BRODERICK ; SOTO DE GIORGIS, RICARDO JAVIER ; Paredes, Fernando. / An artificial bee colony algorithm for the set covering problem. Modern Trends and Techniques in Computer Science - 3rd Computer Science On-line Conference, CSOC 2014. editor / Radek Silhavy ; Roman Senkerik ; Zuzana Kominkova Oplatkova ; Petr Silhavy ; Zdenka Prokopova. Springer Verlag, 2014. pp. 53-63 (Advances in Intelligent Systems and Computing).

@inproceedings{3526f1ca02f2447a966a24051d4c09f2,

title = "An artificial bee colony algorithm for the set covering problem",

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.",

keywords = "Artificial bee colony algorithm, Combinatorial optimization, Heuristic, Set covering problem",

author = "Rodrigo Cuesta and {CRAWFORD LABRIN}, BRODERICK and {SOTO DE GIORGIS}, {RICARDO JAVIER} and Fernando Paredes",

year = "2014",

month = jan,

day = "1",

doi = "10.1007/978-3-319-06740-7_5",

language = "English",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Verlag",

pages = "53--63",

editor = "Radek Silhavy and Roman Senkerik and Oplatkova, {Zuzana Kominkova} and Petr Silhavy and Zdenka Prokopova",

booktitle = "Modern Trends and Techniques in Computer Science - 3rd Computer Science On-line Conference, CSOC 2014",

note = "null ; Conference date: 01-04-2014",

}

Cuesta, R, CRAWFORD LABRIN, BRODERICK , SOTO DE GIORGIS, RICARDOJAVIER & Paredes, F 2014, An artificial bee colony algorithm for the set covering problem. in R Silhavy, R Senkerik, ZK Oplatkova, P Silhavy & Z Prokopova (eds), Modern Trends and Techniques in Computer Science - 3rd Computer Science On-line Conference, CSOC 2014. Advances in Intelligent Systems and Computing, vol. 285, Springer Verlag, pp. 53-63, 3rd Computer Science On-line Conference, CSOC 2014, 1/04/14. https://doi.org/10.1007/978-3-319-06740-7_5

An artificial bee colony algorithm for the set covering problem. / Cuesta, Rodrigo; CRAWFORD LABRIN, BRODERICK ; SOTO DE GIORGIS, RICARDO JAVIER; Paredes, Fernando.

Modern Trends and Techniques in Computer Science - 3rd Computer Science On-line Conference, CSOC 2014. ed. / Radek Silhavy; Roman Senkerik; Zuzana Kominkova Oplatkova; Petr Silhavy; Zdenka Prokopova. Springer Verlag, 2014. p. 53-63 (Advances in Intelligent Systems and Computing; Vol. 285).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An artificial bee colony algorithm for the set covering problem

AU - Cuesta, Rodrigo

AU - CRAWFORD LABRIN, BRODERICK

AU - SOTO DE GIORGIS, RICARDO JAVIER

AU - Paredes, Fernando

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

KW - Artificial bee colony algorithm

KW - Combinatorial optimization

KW - Heuristic

KW - Set covering problem

UR - http://www.scopus.com/inward/record.url?scp=84923807647&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-06740-7_5

DO - 10.1007/978-3-319-06740-7_5

M3 - Conference contribution

AN - SCOPUS:84923807647

T3 - Advances in Intelligent Systems and Computing

SP - 53

EP - 63

BT - Modern Trends and Techniques in Computer Science - 3rd Computer Science On-line Conference, CSOC 2014

A2 - Silhavy, Radek

A2 - Senkerik, Roman

A2 - Oplatkova, Zuzana Kominkova

A2 - Silhavy, Petr

A2 - Prokopova, Zdenka

PB - Springer Verlag

Y2 - 1 April 2014

ER -

Cuesta R, CRAWFORD LABRIN BRODERICK , SOTO DE GIORGIS RICARDOJAVIER, Paredes F. An artificial bee colony algorithm for the set covering problem. In Silhavy R, Senkerik R, Oplatkova ZK, Silhavy P, Prokopova Z, editors, Modern Trends and Techniques in Computer Science - 3rd Computer Science On-line Conference, CSOC 2014. Springer Verlag. 2014. p. 53-63. (Advances in Intelligent Systems and Computing). https://doi.org/10.1007/978-3-319-06740-7_5

An artificial bee colony algorithm for the set covering problem

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Cite this