Mostrar el registro sencillo del ítem
Binary harmony search algorithm for solving set-covering problem
dc.contributor.author | Salas J. | |
dc.contributor.author | Crawford B. | |
dc.contributor.author | Soto R. | |
dc.contributor.author | Rubio Á.G. | |
dc.contributor.author | Jaramillo A. | |
dc.contributor.author | Mansilla Villablanca S. | |
dc.contributor.author | Olguín E. | |
dc.date.accessioned | 2020-09-02T22:27:38Z | |
dc.date.available | 2020-09-02T22:27:38Z | |
dc.date.issued | 2016 | |
dc.identifier | 10.1007/978-3-319-42007-3_78 | |
dc.identifier.citation | 9799, , 917-930 | |
dc.identifier.issn | 03029743 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12728/6146 | |
dc.description | 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. © Springer International Publishing Switzerland 2016. | |
dc.language.iso | en | |
dc.publisher | Springer Verlag | |
dc.source | Ali M.Fujita H.Sasaki J.Kurematsu M.Selamat A. | |
dc.subject | Binary harmony search | |
dc.subject | Metaheuristics | |
dc.subject | Set covering problem | |
dc.subject | Algorithms | |
dc.subject | Bins | |
dc.subject | Heuristic algorithms | |
dc.subject | Intelligent systems | |
dc.subject | Knowledge based systems | |
dc.subject | Learning algorithms | |
dc.subject | Harmony search | |
dc.subject | Harmony search algorithms | |
dc.subject | Meta heuristics | |
dc.subject | Metaheuristic | |
dc.subject | Set covering problem | |
dc.subject | Problem solving | |
dc.title | Binary harmony search algorithm for solving set-covering problem | |
dc.type | Conference Paper |