Binary harmony search algorithm for solving set-covering problem

Juan Salas; Broderick Crawford; Ricardo Soto; Álvaro Gómez Rubio; Adrián Jaramillo; Sebastián Mansilla Villablanca; Eduardo Olguín

doi:10.1007/978-3-319-42007-3_78

Binary harmony search algorithm for solving set-covering problem

Juan Salas, Broderick Crawford, Ricardo Soto, Álvaro Gómez Rubio, Adrián Jaramillo, Sebastián Mansilla Villablanca, Eduardo Olguín

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

1 Scopus citations

Abstract

This paper is intended to generate solutions to Set Covering Problem (SCP) through the use of a metaheuristic. The results were obtained using a variation of Harmony Search called Binary Global-Best Harmony Search Algorithm. To measure the effectiveness of the technique against other metaheuristics, Weasly benchmark was used.

Original language	English
Title of host publication	Trends in Applied Knowledge-Based Systems and Data Science - 29th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2016, Proceedings
Editors	Moonis Ali, Hamido Fujita, Jun Sasaki, Masaki Kurematsu, Ali Selamat
Publisher	Springer Verlag
Pages	917-930
Number of pages	14
ISBN (Print)	9783319420066
DOIs	https://doi.org/10.1007/978-3-319-42007-3_78
State	Published - 2016
Externally published	Yes
Event	29th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2016 - Morioka, Japan Duration: 2 Aug 2016 → 4 Aug 2016

Publication series

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

Conference

Conference	29th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2016
Country/Territory	Japan
City	Morioka
Period	2/08/16 → 4/08/16

Keywords

Binary harmony search
Metaheuristics
Set covering problem

Access to Document

10.1007/978-3-319-42007-3_78

Cite this

Salas, J., Crawford, B., Soto, R., Rubio, Á. G., Jaramillo, A., Mansilla Villablanca, S., & Olguín, E. (2016). Binary harmony search algorithm for solving set-covering problem. In M. Ali, H. Fujita, J. Sasaki, M. Kurematsu, & A. Selamat (Eds.), Trends in Applied Knowledge-Based Systems and Data Science - 29th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2016, Proceedings (pp. 917-930). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9799). Springer Verlag. https://doi.org/10.1007/978-3-319-42007-3_78

Salas, Juan ; Crawford, Broderick ; Soto, Ricardo ; Rubio, Álvaro Gómez ; Jaramillo, Adrián ; Mansilla Villablanca, Sebastián ; Olguín, Eduardo. / Binary harmony search algorithm for solving set-covering problem. Trends in Applied Knowledge-Based Systems and Data Science - 29th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2016, Proceedings. editor / Moonis Ali ; Hamido Fujita ; Jun Sasaki ; Masaki Kurematsu ; Ali Selamat. Springer Verlag, 2016. pp. 917-930 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{fa39578169d54e2d9a9a372a528e3295,

title = "Binary harmony search algorithm for solving set-covering problem",

abstract = "This paper is intended to generate solutions to Set Covering Problem (SCP) through the use of a metaheuristic. The results were obtained using a variation of Harmony Search called Binary Global-Best Harmony Search Algorithm. To measure the effectiveness of the technique against other metaheuristics, Weasly benchmark was used.",

keywords = "Binary harmony search, Metaheuristics, Set covering problem",

author = "Juan Salas and Broderick Crawford and Ricardo Soto and Rubio, {{\'A}lvaro G{\'o}mez} and Adri{\'a}n Jaramillo and {Mansilla Villablanca}, Sebasti{\'a}n and Eduardo Olgu{\'i}n",

note = "Funding Information: Broderick Crawford is supported by Grant CONICYT/FONDECYT/REGULAR/1140897. Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR/1160455. Juan Salas, Sebastian Mansilla, Alvaro Gomez and Adrian Jaramillo are supported by Postgraduate Grant Universidad Catolica de Valparaiso 2016 (INF-PUCV 2016). Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; null ; Conference date: 02-08-2016 Through 04-08-2016",

year = "2016",

doi = "10.1007/978-3-319-42007-3_78",

language = "English",

isbn = "9783319420066",

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

publisher = "Springer Verlag",

pages = "917--930",

editor = "Moonis Ali and Hamido Fujita and Jun Sasaki and Masaki Kurematsu and Ali Selamat",

booktitle = "Trends in Applied Knowledge-Based Systems and Data Science - 29th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2016, Proceedings",

}

Salas, J, Crawford, B , Soto, R, Rubio, ÁG, Jaramillo, A, Mansilla Villablanca, S & Olguín, E 2016, Binary harmony search algorithm for solving set-covering problem. in M Ali, H Fujita, J Sasaki, M Kurematsu & A Selamat (eds), Trends in Applied Knowledge-Based Systems and Data Science - 29th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9799, Springer Verlag, pp. 917-930, 29th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2016, Morioka, Japan, 2/08/16. https://doi.org/10.1007/978-3-319-42007-3_78

Binary harmony search algorithm for solving set-covering problem. / Salas, Juan; Crawford, Broderick ; Soto, Ricardo; Rubio, Álvaro Gómez; Jaramillo, Adrián; Mansilla Villablanca, Sebastián; Olguín, Eduardo.

Trends in Applied Knowledge-Based Systems and Data Science - 29th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2016, Proceedings. ed. / Moonis Ali; Hamido Fujita; Jun Sasaki; Masaki Kurematsu; Ali Selamat. Springer Verlag, 2016. p. 917-930 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9799).

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

TY - GEN

T1 - Binary harmony search algorithm for solving set-covering problem

AU - Salas, Juan

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Rubio, Álvaro Gómez

AU - Jaramillo, Adrián

AU - Mansilla Villablanca, Sebastián

AU - Olguín, Eduardo

N1 - Funding Information: Broderick Crawford is supported by Grant CONICYT/FONDECYT/REGULAR/1140897. Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR/1160455. Juan Salas, Sebastian Mansilla, Alvaro Gomez and Adrian Jaramillo are supported by Postgraduate Grant Universidad Catolica de Valparaiso 2016 (INF-PUCV 2016). Publisher Copyright: © Springer International Publishing Switzerland 2016.

PY - 2016

Y1 - 2016

N2 - This paper is intended to generate solutions to Set Covering Problem (SCP) through the use of a metaheuristic. The results were obtained using a variation of Harmony Search called Binary Global-Best Harmony Search Algorithm. To measure the effectiveness of the technique against other metaheuristics, Weasly benchmark was used.

AB - This paper is intended to generate solutions to Set Covering Problem (SCP) through the use of a metaheuristic. The results were obtained using a variation of Harmony Search called Binary Global-Best Harmony Search Algorithm. To measure the effectiveness of the technique against other metaheuristics, Weasly benchmark was used.

KW - Binary harmony search

KW - Metaheuristics

KW - Set covering problem

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

U2 - 10.1007/978-3-319-42007-3_78

DO - 10.1007/978-3-319-42007-3_78

M3 - Conference contribution

AN - SCOPUS:84978834488

SN - 9783319420066

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

SP - 917

EP - 930

BT - Trends in Applied Knowledge-Based Systems and Data Science - 29th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2016, Proceedings

A2 - Ali, Moonis

A2 - Fujita, Hamido

A2 - Sasaki, Jun

A2 - Kurematsu, Masaki

A2 - Selamat, Ali

PB - Springer Verlag

Y2 - 2 August 2016 through 4 August 2016

ER -

Salas J, Crawford B , Soto R, Rubio ÁG, Jaramillo A, Mansilla Villablanca S et al. Binary harmony search algorithm for solving set-covering problem. In Ali M, Fujita H, Sasaki J, Kurematsu M, Selamat A, editors, Trends in Applied Knowledge-Based Systems and Data Science - 29th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2016, Proceedings. Springer Verlag. 2016. p. 917-930. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-42007-3_78

Binary harmony search algorithm for solving set-covering problem

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this