Comparing Cuckoo Search, Bee Colony, Firefly Optimization, and Electromagnetism-Like Algorithms for Solving the Set Covering Problem
No Thumbnail Available
Date
2015
Journal Title
Journal ISSN
Volume Title
Publisher
Springer-verlag Berlin
Abstract
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.
Description
Misra, Sanjay/0000-0002-3556-9331; Galleguillos, Cristian/0000-0001-9460-8719; Crawford, Broderick/0000-0001-5500-0188
Keywords
Combinatorial optimization, Set covering problem, Cuckoo search algorithm, Bee colony algorithm, Firefly optimization algorithm, Electromagnetism-Like algorithm
Turkish CoHE Thesis Center URL
Citation
6
WoS Q
Scopus Q
Source
15th International Conference on Computational Science and Its Applications (ICCSA) -- JUN 22-25, 2015 -- Banff, CANADA
Volume
9155
Issue
Start Page
187
End Page
202