Abstract
This work proposes Shuffled Frog Leaping Algorithms (SFLAs) to solve Set Covering Problems (SCPs). The proposed algorithms include eight transfer function and five discretization methods in order to solve the binary representation of SCP. Different instances of the SetCovering Problem are solved to test our algorithm showing very promising results.
Author supplied keywords
Cite
CITATION STYLE
Crawford, B., Soto, R., Peña, C., Riquelme-Leiva, M., Torres-Rojas, C., Johnson, F., & Paredes, F. (2015). Binarization methods for shuffled frog leaping algorithms that solve set covering problems. In Advances in Intelligent Systems and Computing (Vol. 349, pp. 317–326). Springer Verlag. https://doi.org/10.1007/978-3-319-18473-9_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
