A binary fruit fly optimization algorithm to solve the set covering problem

Conference Paper
View/Open
Date
2015
DOI
10.1007/978-3-319-21410-832

Metadata
Show full item record
Author
Crawford B.
Soto R.
Torres-Rojas C.
Peña C.
Riquelme-Leiva M.
Misra S.
Johnson F.
Paredes F.
Abstract
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.
Collections