A binary fruit fly optimization algorithm to solve the set covering problem
Fecha
2015
Título de la revista
ISSN de la revista
Título del volumen
Editor
Springer Verlag
Resumen
The Set Covering Problem (SCP) is a well known NP-hard problem with many practical applications. In this work binary fruit fly optimization algorithms (bFFOA) were used to solve this problem using different binarization methods. The bFFOA is based on the food finding behavior of the fruit flies using osphresis and vision. The experimental results show the effectiveness of our algorithms producing competitive results when solve the benchmarks of SCP from the OR-Library. © Springer International Publishing Switzerland 2015.
Descripción
Palabras clave
Computer Science, Mathematics