Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem
MetadataShow full item record
The set covering problem is a classical model in the subject of combinatorial optimization for service allocation, that consists in finding a set of solutions for covering a range of needs at the lowest possible cost. In this paper, we report various approximate methods to solve this problem, such as Cuckoo Search, Bee Colony, Firefly Optimization, and Electromagnetism-Like Algorithms. We illustrate experimental results of these metaheuristics for solving a set of 65 non-unicost set covering problems from the Beasley’s OR-Library. © Springer International Publishing Switzerland 2015.
Showing items related by title, author, creator and subject.
Modified binary firefly algorithms with different transfer functions for solving set covering problems (2020) Crawford B.; Soto R.; Riquelme-Leiva M.; Peña C.; Torres-Rojas C.; Johnson F.; Paredes F. (Springer Verlag, 2015)
Solving pre-processed set covering problems via cuckoo search and lévy flights [Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight] (2020) Soto R.; Crawford B.; Barraza J.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015)
Conference PaperCrawford B.; Soto R.; Aballay F.; Misra S.; Johnson F.; Paredes F. (Springer Verlag, 2015)