A binary firefly algorithm for the set covering problem

Broderick Crawford; Ricardo Soto; Miguel Olivares-Suárez; Fernando Paredes

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

A binary firefly algorithm for the set covering problem

Broderick Crawford, Ricardo Soto, Miguel Olivares-Suárez, Fernando Paredes

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

42 Scopus citations

Abstract

The non-unicost Set Covering Problem is a well-known NP-hard problem with many practical applications. In this work, a new approach based on Binary Firefly Algorithm is proposed to solve this problem. The Firefly Algorithm has attracted much attention and has been applied to many optimization problems. Here, we demonstrate that is also able to produce very competitive results solving the portfolio of set covering problems from the OR-Library.

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	65-73
Number of pages	9
ISBN (Electronic)	9783319067391
DOIs	https://doi.org/10.1007/978-3-319-06740-7_6
State	Published - 2014
Externally published	Yes
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

Binary firefly algorithm
Metaheuristic
Set covering problem

Access to Document

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

Cite this

Crawford, B., Soto, R., Olivares-Suárez, M., & Paredes, F. (2014). A binary firefly 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. 65-73). (Advances in Intelligent Systems and Computing; Vol. 285). Springer Verlag. https://doi.org/10.1007/978-3-319-06740-7_6

Crawford, Broderick ; Soto, Ricardo ; Olivares-Suárez, Miguel ; Paredes, Fernando. / A binary firefly 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. 65-73 (Advances in Intelligent Systems and Computing).

@inproceedings{c4179dfcee564990b0a1c2b9215021ab,

title = "A binary firefly algorithm for the set covering problem",

abstract = "The non-unicost Set Covering Problem is a well-known NP-hard problem with many practical applications. In this work, a new approach based on Binary Firefly Algorithm is proposed to solve this problem. The Firefly Algorithm has attracted much attention and has been applied to many optimization problems. Here, we demonstrate that is also able to produce very competitive results solving the portfolio of set covering problems from the OR-Library.",

keywords = "Binary firefly algorithm, Metaheuristic, Set covering problem",

author = "Broderick Crawford and Ricardo Soto and Miguel Olivares-Su{\'a}rez and Fernando Paredes",

note = "Funding Information: The author B. Crawford is supported by Grant CONICYT/FONDECYT/REGU- LAR/1140897. The author R. Soto is supported by Grant CONICYT/FON- DECYT/INICIACION/11130459. The author F. Paredes is supported by Grant CONICYT/FONDECYT/REGULAR/1130455. Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2014.; null ; Conference date: 01-04-2014",

year = "2014",

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

language = "English",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Verlag",

pages = "65--73",

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

}

Crawford, B , Soto, R, Olivares-Suárez, M & Paredes, F 2014, A binary firefly 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. 65-73, 3rd Computer Science On-line Conference, CSOC 2014, 1/04/14. https://doi.org/10.1007/978-3-319-06740-7_6

A binary firefly algorithm for the set covering problem. / Crawford, Broderick ; Soto, Ricardo; Olivares-Suárez, Miguel; 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. 65-73 (Advances in Intelligent Systems and Computing; Vol. 285).

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

TY - GEN

T1 - A binary firefly algorithm for the set covering problem

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Olivares-Suárez, Miguel

AU - Paredes, Fernando

N1 - Funding Information: The author B. Crawford is supported by Grant CONICYT/FONDECYT/REGU- LAR/1140897. The author R. Soto is supported by Grant CONICYT/FON- DECYT/INICIACION/11130459. The author F. Paredes is supported by Grant CONICYT/FONDECYT/REGULAR/1130455. Publisher Copyright: © Springer International Publishing Switzerland 2014.

PY - 2014

Y1 - 2014

N2 - The non-unicost Set Covering Problem is a well-known NP-hard problem with many practical applications. In this work, a new approach based on Binary Firefly Algorithm is proposed to solve this problem. The Firefly Algorithm has attracted much attention and has been applied to many optimization problems. Here, we demonstrate that is also able to produce very competitive results solving the portfolio of set covering problems from the OR-Library.

AB - The non-unicost Set Covering Problem is a well-known NP-hard problem with many practical applications. In this work, a new approach based on Binary Firefly Algorithm is proposed to solve this problem. The Firefly Algorithm has attracted much attention and has been applied to many optimization problems. Here, we demonstrate that is also able to produce very competitive results solving the portfolio of set covering problems from the OR-Library.

KW - Binary firefly algorithm

KW - Metaheuristic

KW - Set covering problem

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

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

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

M3 - Conference contribution

AN - SCOPUS:84923779730

T3 - Advances in Intelligent Systems and Computing

SP - 65

EP - 73

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 -

Crawford B , Soto R, Olivares-Suárez M, Paredes F. A binary firefly 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. 65-73. (Advances in Intelligent Systems and Computing). https://doi.org/10.1007/978-3-319-06740-7_6

A binary firefly algorithm for the set covering problem

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this