Mostrar el registro sencillo del ítem
A binary firefly algorithm for the set covering problem
dc.contributor.author | Crawford B. | |
dc.contributor.author | Soto R. | |
dc.contributor.author | Olivares-Suárez M. | |
dc.contributor.author | Paredes F. | |
dc.date.accessioned | 2020-09-02T22:15:42Z | |
dc.date.available | 2020-09-02T22:15:42Z | |
dc.date.issued | 2014 | |
dc.identifier | 10.1007/978-3-319-06740-7_6 | |
dc.identifier.citation | 285, , 65-73 | |
dc.identifier.issn | 21945357 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12728/4163 | |
dc.description | The non-unicost Set Covering Problem is a well-known NP-hard problem with many practical applications. In this work, a new approach based on Binary Firefly Algorithm is proposed to solve this problem. The Firefly Algorithm has attracted much attention and has been applied to many optimization problems. Here, we demonstrate that is also able to produce very competitive results solving the portfolio of set covering problems from the OR-Library. © Springer International Publishing Switzerland 2014. | |
dc.language.iso | en | |
dc.publisher | Springer Verlag | |
dc.source | Silhavy R.Senkerik R.Oplatkova Z.K.Silhavy P.Prokopova Z. | |
dc.subject | Binary firefly algorithm | |
dc.subject | Metaheuristic | |
dc.subject | Set covering problem | |
dc.subject | Algorithms | |
dc.subject | Bioluminescence | |
dc.subject | Computational complexity | |
dc.subject | Factory automation | |
dc.subject | Optimization | |
dc.subject | Social networking (online) | |
dc.subject | Firefly algorithms | |
dc.subject | Metaheuristic | |
dc.subject | New approaches | |
dc.subject | Optimization problems | |
dc.subject | Set covering problem | |
dc.subject | Problem solving | |
dc.title | A binary firefly algorithm for the set covering problem | |
dc.type | Conference Paper |