A Binary Firefly Algorithm for the Set Covering Problem
Keywords: set covering problem, metaheuristic, Binary Firefly Algorithm
Abstract
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.
Más información
Título según WOS: | A Binary Firefly Algorithm for the Set Covering Problem |
Título según SCOPUS: | A binary firefly algorithm for the set covering problem |
Título de la Revista: | INTELLIGENT METHODS IN COMPUTING, COMMUNICATIONS AND CONTROL |
Volumen: | 285 |
Editorial: | SPRINGER INTERNATIONAL PUBLISHING AG |
Fecha de publicación: | 2014 |
Página de inicio: | 65 |
Página final: | 73 |
Idioma: | English |
DOI: |
10.1007/978-3-319-06740-7_6 |
Notas: | ISI, SCOPUS |