A multi dynamic binary black hole algorithm applied to set covering problem

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

30 Scopus citations

Abstract

The set covering problem seeks for minimum cost family of subsets from n given subsets, which together covers the complete set. In this article, we present multi dynamic binary black hole algorithm for resolving the set covering problem. This algorithm has the particularity to propose a generic dynamic binarization method to manage the exploration and exploitation properties. Furthermore we explore the implementation of the algorithm on Apache Spark distributed framework.

Original languageEnglish
Title of host publicationHarmony Search Algorithm - Proceedings of the 3rd International Conference on Harmony Search Algorithm (ICHSA 2017)
EditorsJavier Del Ser
PublisherSpringer Verlag
Pages42-51
Number of pages10
ISBN (Print)9789811037276
DOIs
StatePublished - 1 Jan 2017
EventProceedings of the 3rd International Conference on Harmony Search Algorithm, ICHSA 2017 - Bilbao, Spain
Duration: 22 Feb 201724 Feb 2017

Publication series

NameAdvances in Intelligent Systems and Computing
Volume514
ISSN (Print)2194-5357

Conference

ConferenceProceedings of the 3rd International Conference on Harmony Search Algorithm, ICHSA 2017
CountrySpain
CityBilbao
Period22/02/1724/02/17

Keywords

  • Binarization
  • Black hole
  • Metaheuristics
  • Set covering problem
  • Spark big data framework

Fingerprint Dive into the research topics of 'A multi dynamic binary black hole algorithm applied to set covering problem'. Together they form a unique fingerprint.

Cite this