Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem

Ricardo Soto; Broderick Crawford; Cristian Galleguillos; Jorge Barraza; Sebastián Lizama; Alexis Muñoz; José Vilches; Sanjay Misra; Fernando Paredes

doi:10.1007/978-3-319-21404-7_14

Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem

Ricardo Soto, Broderick Crawford, Cristian Galleguillos, Jorge Barraza, Sebastián Lizama, Alexis Muñoz, José Vilches, Sanjay Misra, Fernando Paredes

SCHOOL OF COMPUTER ENGINEERING

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

6 Scopus citations

Abstract

The set covering problem is a classical model in the subject of combinatorial optimization for service allocation, that consists in finding a set of solutions for covering a range of needs at the lowest possible cost. In this paper, we report various approximate methods to solve this problem, such as Cuckoo Search, Bee Colony, Firefly Optimization, and Electromagnetism-Like Algorithms. We illustrate experimental results of these metaheuristics for solving a set of 65 non-unicost set covering problems from the Beasley’s OR-Library.

Original language	English
Title of host publication	Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings
Editors	Sanjay Misra, Bernady O. Apduhan, Beniamino Murgante, Marina L. Gavrilova, David Taniar, Osvaldo Gervasi, Sanjay Misra, Carmelo Torre, Ana Maria A.C. Rocha
Publisher	Springer Verlag
Pages	187-202
Number of pages	16
ISBN (Print)	9783319214030
DOIs	https://doi.org/10.1007/978-3-319-21404-7_14
State	Published - 2015
Event	15th International Conference on Computational Science and Its Applications, ICCSA 2015 - Banff, Canada Duration: 22 Jun 2015 → 25 Jun 2015

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9155
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	15th International Conference on Computational Science and Its Applications, ICCSA 2015
Country/Territory	Canada
City	Banff
Period	22/06/15 → 25/06/15

Keywords

Bee colony algorithm
Combinatorial optimization
Cuckoo search algorithm
Electromagnetism-Like algorithm
Firefly optimization algorithm
Set covering problem

Access to Document

10.1007/978-3-319-21404-7_14

Cite this

Soto, R., Crawford, B., Galleguillos, C., Barraza, J., Lizama, S., Muñoz, A., Vilches, J., Misra, S., & Paredes, F. (2015). Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem. In S. Misra, B. O. Apduhan, B. Murgante, M. L. Gavrilova, D. Taniar, O. Gervasi, S. Misra, C. Torre, & A. M. A. C. Rocha (Eds.), Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings (pp. 187-202). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9155). Springer Verlag. https://doi.org/10.1007/978-3-319-21404-7_14

Soto, Ricardo ; Crawford, Broderick ; Galleguillos, Cristian et al. / Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem. Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings. editor / Sanjay Misra ; Bernady O. Apduhan ; Beniamino Murgante ; Marina L. Gavrilova ; David Taniar ; Osvaldo Gervasi ; Sanjay Misra ; Carmelo Torre ; Ana Maria A.C. Rocha. Springer Verlag, 2015. pp. 187-202 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{36f16f605877464a952689a5c42ed39f,

title = "Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem",

abstract = "The set covering problem is a classical model in the subject of combinatorial optimization for service allocation, that consists in finding a set of solutions for covering a range of needs at the lowest possible cost. In this paper, we report various approximate methods to solve this problem, such as Cuckoo Search, Bee Colony, Firefly Optimization, and Electromagnetism-Like Algorithms. We illustrate experimental results of these metaheuristics for solving a set of 65 non-unicost set covering problems from the Beasley{\textquoteright}s OR-Library.",

keywords = "Bee colony algorithm, Combinatorial optimization, Cuckoo search algorithm, Electromagnetism-Like algorithm, Firefly optimization algorithm, Set covering problem",

author = "Ricardo Soto and Broderick Crawford and Cristian Galleguillos and Jorge Barraza and Sebasti{\'a}n Lizama and Alexis Mu{\~n}oz and Jos{\'e} Vilches and Sanjay Misra and Fernando Paredes",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 15th International Conference on Computational Science and Its Applications, ICCSA 2015 ; Conference date: 22-06-2015 Through 25-06-2015",

year = "2015",

doi = "10.1007/978-3-319-21404-7_14",

language = "English",

isbn = "9783319214030",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "187--202",

editor = "Sanjay Misra and Apduhan, {Bernady O.} and Beniamino Murgante and Gavrilova, {Marina L.} and David Taniar and Osvaldo Gervasi and Sanjay Misra and Carmelo Torre and Rocha, {Ana Maria A.C.}",

booktitle = "Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings",

}

Soto, R , Crawford, B, Galleguillos, C, Barraza, J, Lizama, S, Muñoz, A, Vilches, J, Misra, S & Paredes, F 2015, Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem. in S Misra, BO Apduhan, B Murgante, ML Gavrilova, D Taniar, O Gervasi, S Misra, C Torre & AMAC Rocha (eds), Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9155, Springer Verlag, pp. 187-202, 15th International Conference on Computational Science and Its Applications, ICCSA 2015, Banff, Canada, 22/06/15. https://doi.org/10.1007/978-3-319-21404-7_14

Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem. / Soto, Ricardo ; Crawford, Broderick; Galleguillos, Cristian et al.
Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings. ed. / Sanjay Misra; Bernady O. Apduhan; Beniamino Murgante; Marina L. Gavrilova; David Taniar; Osvaldo Gervasi; Sanjay Misra; Carmelo Torre; Ana Maria A.C. Rocha. Springer Verlag, 2015. p. 187-202 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9155).

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

TY - GEN

T1 - Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem

AU - Soto, Ricardo

AU - Crawford, Broderick

AU - Galleguillos, Cristian

AU - Barraza, Jorge

AU - Lizama, Sebastián

AU - Muñoz, Alexis

AU - Vilches, José

AU - Misra, Sanjay

AU - Paredes, Fernando

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2015.

PY - 2015

Y1 - 2015

N2 - The set covering problem is a classical model in the subject of combinatorial optimization for service allocation, that consists in finding a set of solutions for covering a range of needs at the lowest possible cost. In this paper, we report various approximate methods to solve this problem, such as Cuckoo Search, Bee Colony, Firefly Optimization, and Electromagnetism-Like Algorithms. We illustrate experimental results of these metaheuristics for solving a set of 65 non-unicost set covering problems from the Beasley’s OR-Library.

AB - The set covering problem is a classical model in the subject of combinatorial optimization for service allocation, that consists in finding a set of solutions for covering a range of needs at the lowest possible cost. In this paper, we report various approximate methods to solve this problem, such as Cuckoo Search, Bee Colony, Firefly Optimization, and Electromagnetism-Like Algorithms. We illustrate experimental results of these metaheuristics for solving a set of 65 non-unicost set covering problems from the Beasley’s OR-Library.

KW - Bee colony algorithm

KW - Combinatorial optimization

KW - Cuckoo search algorithm

KW - Electromagnetism-Like algorithm

KW - Firefly optimization algorithm

KW - Set covering problem

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

U2 - 10.1007/978-3-319-21404-7_14

DO - 10.1007/978-3-319-21404-7_14

M3 - Conference contribution

AN - SCOPUS:84948971651

SN - 9783319214030

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 187

EP - 202

BT - Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings

A2 - Misra, Sanjay

A2 - Apduhan, Bernady O.

A2 - Murgante, Beniamino

A2 - Gavrilova, Marina L.

A2 - Taniar, David

A2 - Gervasi, Osvaldo

A2 - Misra, Sanjay

A2 - Torre, Carmelo

A2 - Rocha, Ana Maria A.C.

PB - Springer Verlag

T2 - 15th International Conference on Computational Science and Its Applications, ICCSA 2015

Y2 - 22 June 2015 through 25 June 2015

ER -

Soto R , Crawford B, Galleguillos C, Barraza J, Lizama S, Muñoz A et al. Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem. In Misra S, Apduhan BO, Murgante B, Gavrilova ML, Taniar D, Gervasi O, Misra S, Torre C, Rocha AMAC, editors, Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Proceedings. Springer Verlag. 2015. p. 187-202. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-21404-7_14

Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this