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 proceedingConference contributionpeer-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 languageEnglish
Title of host publicationTrends 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
EditorsMoonis Ali, Hamido Fujita, Jun Sasaki, Masaki Kurematsu, Ali Selamat
PublisherSpringer Verlag
Pages917-930
Number of pages14
ISBN (Print)9783319420066
DOIs
StatePublished - 2016
Externally publishedYes
Event29th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2016 - Morioka, Japan
Duration: 2 Aug 20164 Aug 2016

Publication series

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

Conference

Conference29th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2016
Country/TerritoryJapan
CityMorioka
Period2/08/164/08/16

Keywords

  • Binary harmony search
  • Metaheuristics
  • Set covering problem

Fingerprint

Dive into the research topics of 'Binary harmony search algorithm for solving set-covering problem'. Together they form a unique fingerprint.

Cite this