In this paper, we propose a set of Modified Binary Firefly Algorithms (MBFF) to solve different instances of the Set Covering Problem (SCP). The algorithms consider eight Transfer Functions and five Discretization Methods in order to solve the binary representation of SCP. The results obtained show that our algorithms are a good and cheap alternative to solve the problem at hand.
CITATION STYLE
Crawford, B., Soto, R., Riquelme-Leiva, M., Peña, C., Torres-Rojas, C., Johnson, F., & Paredes, F. (2015). Modified binary firefly algorithms with different transfer functions for solving set covering problems. In Advances in Intelligent Systems and Computing (Vol. 349, pp. 307–315). Springer Verlag. https://doi.org/10.1007/978-3-319-18473-9_30
Mendeley helps you to discover research relevant for your work.