A binary cuckoo search algorithm for solving the set covering problem

Ricardo Soto; Broderick Crawford; Rodrigo Olivares; Jorge Barraza; Franklin Johnson; Fernando Paredes

doi:10.1007/978-3-319-18833-1_10

A binary cuckoo search algorithm for solving the set covering problem

Ricardo Soto, Broderick Crawford, Rodrigo Olivares, Jorge Barraza, Franklin Johnson, Fernando Paredes

SCHOOL OF COMPUTER ENGINEERING

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

25 Scopus citations

Abstract

The non-unicost set covering problem is a classical optimization benchmark that belongs to the Karp’s 21 NP-complete problems. In this paper, we present a new approach based on cuckoo search for solving such problem. Cuckoo search is a modern nature-inspired metaheuristic that has attracted much attention due to its rapid convergence and easy implementation. We illustrate interesting experimental results where the proposed cuckoo search algorithm reaches several global optimums for the non-unicost instances from the OR-Library.

Original language	English
Title of host publication	Bioinspired Computation in Artificial Systems - International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015, Proceedings
Editors	José Ramón Álvarez-Sánchez, Félix de la Paz López, Hojjat Adeli, José Manuel Ferrández Vicente, Fco. Javier Toledo-Moreo
Publisher	Springer Verlag
Pages	88-97
Number of pages	10
ISBN (Electronic)	9783319188324
DOIs	https://doi.org/10.1007/978-3-319-18833-1_10
State	Published - 2015
Event	International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015 - Elche, Spain Duration: 1 Jun 2015 → 5 Jun 2015

Publication series

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

Conference

Conference	International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015
Country/Territory	Spain
City	Elche
Period	1/06/15 → 5/06/15

Keywords

Cuckoo Search
Metaheuristics
Set Covering Problem

Access to Document

10.1007/978-3-319-18833-1_10

Cite this

Soto, R., Crawford, B., Olivares, R., Barraza, J., Johnson, F., & Paredes, F. (2015). A binary cuckoo search algorithm for solving the set covering problem. In J. R. Álvarez-Sánchez, F. de la Paz López, H. Adeli, J. M. F. Vicente, & F. J. Toledo-Moreo (Eds.), Bioinspired Computation in Artificial Systems - International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015, Proceedings (pp. 88-97). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9108). Springer Verlag. https://doi.org/10.1007/978-3-319-18833-1_10

Soto, Ricardo ; Crawford, Broderick ; Olivares, Rodrigo et al. / A binary cuckoo search algorithm for solving the set covering problem. Bioinspired Computation in Artificial Systems - International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015, Proceedings. editor / José Ramón Álvarez-Sánchez ; Félix de la Paz López ; Hojjat Adeli ; José Manuel Ferrández Vicente ; Fco. Javier Toledo-Moreo. Springer Verlag, 2015. pp. 88-97 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{2e5fba75286141579f123cd09661c457,

title = "A binary cuckoo search algorithm for solving the set covering problem",

abstract = "The non-unicost set covering problem is a classical optimization benchmark that belongs to the Karp{\textquoteright}s 21 NP-complete problems. In this paper, we present a new approach based on cuckoo search for solving such problem. Cuckoo search is a modern nature-inspired metaheuristic that has attracted much attention due to its rapid convergence and easy implementation. We illustrate interesting experimental results where the proposed cuckoo search algorithm reaches several global optimums for the non-unicost instances from the OR-Library.",

keywords = "Cuckoo Search, Metaheuristics, Set Covering Problem",

author = "Ricardo Soto and Broderick Crawford and Rodrigo Olivares and Jorge Barraza and Franklin Johnson and Fernando Paredes",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015; International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015 ; Conference date: 01-06-2015 Through 05-06-2015",

year = "2015",

doi = "10.1007/978-3-319-18833-1_10",

language = "English",

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

publisher = "Springer Verlag",

pages = "88--97",

editor = "{\'A}lvarez-S{\'a}nchez, {Jos{\'e} Ram{\'o}n} and {de la Paz L{\'o}pez}, F{\'e}lix and Hojjat Adeli and Vicente, {Jos{\'e} Manuel Ferr{\'a}ndez} and Toledo-Moreo, {Fco. Javier}",

booktitle = "Bioinspired Computation in Artificial Systems - International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015, Proceedings",

}

Soto, R , Crawford, B, Olivares, R, Barraza, J, Johnson, F & Paredes, F 2015, A binary cuckoo search algorithm for solving the set covering problem. in JR Álvarez-Sánchez, F de la Paz López, H Adeli, JMF Vicente & FJ Toledo-Moreo (eds), Bioinspired Computation in Artificial Systems - International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9108, Springer Verlag, pp. 88-97, International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015, Elche, Spain, 1/06/15. https://doi.org/10.1007/978-3-319-18833-1_10

A binary cuckoo search algorithm for solving the set covering problem. / Soto, Ricardo ; Crawford, Broderick; Olivares, Rodrigo et al.
Bioinspired Computation in Artificial Systems - International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015, Proceedings. ed. / José Ramón Álvarez-Sánchez; Félix de la Paz López; Hojjat Adeli; José Manuel Ferrández Vicente; Fco. Javier Toledo-Moreo. Springer Verlag, 2015. p. 88-97 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9108).

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

TY - GEN

T1 - A binary cuckoo search algorithm for solving the set covering problem

AU - Soto, Ricardo

AU - Crawford, Broderick

AU - Olivares, Rodrigo

AU - Barraza, Jorge

AU - Johnson, Franklin

AU - Paredes, Fernando

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2015

PY - 2015

Y1 - 2015

N2 - The non-unicost set covering problem is a classical optimization benchmark that belongs to the Karp’s 21 NP-complete problems. In this paper, we present a new approach based on cuckoo search for solving such problem. Cuckoo search is a modern nature-inspired metaheuristic that has attracted much attention due to its rapid convergence and easy implementation. We illustrate interesting experimental results where the proposed cuckoo search algorithm reaches several global optimums for the non-unicost instances from the OR-Library.

AB - The non-unicost set covering problem is a classical optimization benchmark that belongs to the Karp’s 21 NP-complete problems. In this paper, we present a new approach based on cuckoo search for solving such problem. Cuckoo search is a modern nature-inspired metaheuristic that has attracted much attention due to its rapid convergence and easy implementation. We illustrate interesting experimental results where the proposed cuckoo search algorithm reaches several global optimums for the non-unicost instances from the OR-Library.

KW - Cuckoo Search

KW - Metaheuristics

KW - Set Covering Problem

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

U2 - 10.1007/978-3-319-18833-1_10

DO - 10.1007/978-3-319-18833-1_10

M3 - Conference contribution

AN - SCOPUS:84937684855

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

SP - 88

EP - 97

BT - Bioinspired Computation in Artificial Systems - International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015, Proceedings

A2 - Álvarez-Sánchez, José Ramón

A2 - de la Paz López, Félix

A2 - Adeli, Hojjat

A2 - Vicente, José Manuel Ferrández

A2 - Toledo-Moreo, Fco. Javier

PB - Springer Verlag

T2 - International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015

Y2 - 1 June 2015 through 5 June 2015

ER -

Soto R , Crawford B, Olivares R, Barraza J, Johnson F, Paredes F. A binary cuckoo search algorithm for solving the set covering problem. In Álvarez-Sánchez JR, de la Paz López F, Adeli H, Vicente JMF, Toledo-Moreo FJ, editors, Bioinspired Computation in Artificial Systems - International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015, Proceedings. Springer Verlag. 2015. p. 88-97. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-18833-1_10

A binary cuckoo search algorithm for solving the set covering problem

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this