Recent harmony search algorithms for 0–1 optimization problems

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


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 languageEnglish
Title of host publicationHCI International 2015 – Posters Extended Abstracts - International Conference, HCI International 2015, Proceedings
EditorsConstantine Stephanidis
PublisherSpringer Verlag
Number of pages6
ISBN (Print)9783319213798
StatePublished - 2015
Event17th International Conference on Human Computer Interaction, HCI 2015 - Los Angeles, United States
Duration: 2 Aug 20157 Aug 2015

Publication series

NameCommunications in Computer and Information Science
ISSN (Print)1865-0929


Conference17th International Conference on Human Computer Interaction, HCI 2015
Country/TerritoryUnited States
CityLos Angeles


  • Harmony search algorithm
  • Metaheuristics
  • Set covering problem


Dive into the research topics of 'Recent harmony search algorithms for 0–1 optimization problems'. Together they form a unique fingerprint.

Cite this