Recent harmony search algorithms for 0–1 optimization problems

Broderick Crawford; Ricardo Soto; Néstor Guzmán; Franklin Johnson; Fernando Paredes

doi:10.1007/978-3-319-21380-4_96

Recent harmony search algorithms for 0–1 optimization problems

Broderick Crawford, Ricardo Soto, Néstor Guzmán, Franklin Johnson, Fernando Paredes

SCHOOL OF COMPUTER ENGINEERING

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

1 Scopus citations

Abstract

The Set Covering Problem (SCP) has long been concentrating the interest of many researchers in the field of Combinatorial Optimization. SCP is a 0–1 integer programming problem that consists in finding a set of solutions which allow to cover a set of needs at the lowest cost possible. There are many applications of these kind of problems, the main ones are: location of services, files selection in a data bank, simplification of boolean expressions, balancing production lines, among others. Different metaheuristics have been proposed to solve it. Here, we present the possibilities to solve Set Covering Problems with Harmony Search.

Original language	English
Title of host publication	HCI International 2015 – Posters Extended Abstracts - International Conference, HCI International 2015, Proceedings
Editors	Constantine Stephanidis
Publisher	Springer Verlag
Pages	567-572
Number of pages	6
ISBN (Print)	9783319213798
DOIs	https://doi.org/10.1007/978-3-319-21380-4_96
State	Published - 2015
Event	17th International Conference on Human Computer Interaction, HCI 2015 - Los Angeles, United States Duration: 2 Aug 2015 → 7 Aug 2015

Publication series

Name	Communications in Computer and Information Science
Volume	528
ISSN (Print)	1865-0929

Conference

Conference	17th International Conference on Human Computer Interaction, HCI 2015
Country/Territory	United States
City	Los Angeles
Period	2/08/15 → 7/08/15

Keywords

Harmony search algorithm
Metaheuristics
Set covering problem

Access to Document

10.1007/978-3-319-21380-4_96

Cite this

Crawford, B., Soto, R., Guzmán, N., Johnson, F., & Paredes, F. (2015). Recent harmony search algorithms for 0–1 optimization problems. In C. Stephanidis (Ed.), HCI International 2015 – Posters Extended Abstracts - International Conference, HCI International 2015, Proceedings (pp. 567-572). (Communications in Computer and Information Science; Vol. 528). Springer Verlag. https://doi.org/10.1007/978-3-319-21380-4_96

Crawford, Broderick ; Soto, Ricardo ; Guzmán, Néstor et al. / Recent harmony search algorithms for 0–1 optimization problems. HCI International 2015 – Posters Extended Abstracts - International Conference, HCI International 2015, Proceedings. editor / Constantine Stephanidis. Springer Verlag, 2015. pp. 567-572 (Communications in Computer and Information Science).

@inproceedings{a91f5c7cdc7b456c96937e53f95479d1,

title = "Recent harmony search algorithms for 0–1 optimization problems",

abstract = "The Set Covering Problem (SCP) has long been concentrating the interest of many researchers in the field of Combinatorial Optimization. SCP is a 0–1 integer programming problem that consists in finding a set of solutions which allow to cover a set of needs at the lowest cost possible. There are many applications of these kind of problems, the main ones are: location of services, files selection in a data bank, simplification of boolean expressions, balancing production lines, among others. Different metaheuristics have been proposed to solve it. Here, we present the possibilities to solve Set Covering Problems with Harmony Search.",

keywords = "Harmony search algorithm, Metaheuristics, Set covering problem",

author = "Broderick Crawford and Ricardo Soto and N{\'e}stor Guzm{\'a}n and Franklin Johnson and Fernando Paredes",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 17th International Conference on Human Computer Interaction, HCI 2015 ; Conference date: 02-08-2015 Through 07-08-2015",

year = "2015",

doi = "10.1007/978-3-319-21380-4_96",

language = "English",

isbn = "9783319213798",

series = "Communications in Computer and Information Science",

publisher = "Springer Verlag",

pages = "567--572",

editor = "Constantine Stephanidis",

booktitle = "HCI International 2015 – Posters Extended Abstracts - International Conference, HCI International 2015, Proceedings",

}

Crawford, B , Soto, R, Guzmán, N, Johnson, F & Paredes, F 2015, Recent harmony search algorithms for 0–1 optimization problems. in C Stephanidis (ed.), HCI International 2015 – Posters Extended Abstracts - International Conference, HCI International 2015, Proceedings. Communications in Computer and Information Science, vol. 528, Springer Verlag, pp. 567-572, 17th International Conference on Human Computer Interaction, HCI 2015, Los Angeles, United States, 2/08/15. https://doi.org/10.1007/978-3-319-21380-4_96

Recent harmony search algorithms for 0–1 optimization problems. / Crawford, Broderick ; Soto, Ricardo; Guzmán, Néstor et al.
HCI International 2015 – Posters Extended Abstracts - International Conference, HCI International 2015, Proceedings. ed. / Constantine Stephanidis. Springer Verlag, 2015. p. 567-572 (Communications in Computer and Information Science; Vol. 528).

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

TY - GEN

T1 - Recent harmony search algorithms for 0–1 optimization problems

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Guzmán, Néstor

AU - Johnson, Franklin

AU - Paredes, Fernando

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

PY - 2015

Y1 - 2015

N2 - The Set Covering Problem (SCP) has long been concentrating the interest of many researchers in the field of Combinatorial Optimization. SCP is a 0–1 integer programming problem that consists in finding a set of solutions which allow to cover a set of needs at the lowest cost possible. There are many applications of these kind of problems, the main ones are: location of services, files selection in a data bank, simplification of boolean expressions, balancing production lines, among others. Different metaheuristics have been proposed to solve it. Here, we present the possibilities to solve Set Covering Problems with Harmony Search.

AB - The Set Covering Problem (SCP) has long been concentrating the interest of many researchers in the field of Combinatorial Optimization. SCP is a 0–1 integer programming problem that consists in finding a set of solutions which allow to cover a set of needs at the lowest cost possible. There are many applications of these kind of problems, the main ones are: location of services, files selection in a data bank, simplification of boolean expressions, balancing production lines, among others. Different metaheuristics have been proposed to solve it. Here, we present the possibilities to solve Set Covering Problems with Harmony Search.

KW - Harmony search algorithm

KW - Metaheuristics

KW - Set covering problem

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

U2 - 10.1007/978-3-319-21380-4_96

DO - 10.1007/978-3-319-21380-4_96

M3 - Conference contribution

AN - SCOPUS:84951839143

SN - 9783319213798

T3 - Communications in Computer and Information Science

SP - 567

EP - 572

BT - HCI International 2015 – Posters Extended Abstracts - International Conference, HCI International 2015, Proceedings

A2 - Stephanidis, Constantine

PB - Springer Verlag

T2 - 17th International Conference on Human Computer Interaction, HCI 2015

Y2 - 2 August 2015 through 7 August 2015

ER -

Crawford B , Soto R, Guzmán N, Johnson F, Paredes F. Recent harmony search algorithms for 0–1 optimization problems. In Stephanidis C, editor, HCI International 2015 – Posters Extended Abstracts - International Conference, HCI International 2015, Proceedings. Springer Verlag. 2015. p. 567-572. (Communications in Computer and Information Science). doi: 10.1007/978-3-319-21380-4_96

Recent harmony search algorithms for 0–1 optimization problems

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this