Abstract
The non-unicost set covering problem is a classical optimization benchmark that belongs to the Karp’s 21 NP-complete problems. In this paper, we present a new approach based on cuckoo search for solving such problem. Cuckoo search is a modern nature-inspired metaheuristic that has attracted much attention due to its rapid convergence and easy implementation. We illustrate interesting experimental results where the proposed cuckoo search algorithm reaches several global optimums for the non-unicost instances from the OR-Library.
Author supplied keywords
Cite
CITATION STYLE
Soto, R., Crawford, B., Olivares, R., Barraza, J., Johnson, F., & Paredes, F. (2015). A binary cuckoo search algorithm for solving the set covering problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9108, pp. 88–97). Springer Verlag. https://doi.org/10.1007/978-3-319-18833-1_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
