@inproceedings{d1510e29e1ba47d8ae75a1733feecfef,

title = "A multi dynamic binary black hole algorithm applied to set covering problem",

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.",

keywords = "Binarization, Black hole, Metaheuristics, Set covering problem, Spark big data framework",

author = "Jos{\'e} Garc{\'i}a and {CRAWFORD LABRIN}, BRODERICK and {SOTO DE GIORGIS}, {RICARDO JAVIER} and Pablo Garc{\'i}a",

year = "2017",

month = jan,

day = "1",

doi = "10.1007/978-981-10-3728-3_6",

language = "English",

isbn = "9789811037276",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Verlag",

pages = "42--51",

editor = "{Del Ser}, Javier",

booktitle = "Harmony Search Algorithm - Proceedings of the 3rd International Conference on Harmony Search Algorithm (ICHSA 2017)",

note = "null ; Conference date: 22-02-2017 Through 24-02-2017",

}