Using the Firefly Optimization Method to Solve the Weighted Set Covering Problem

Conference Paper
View/Open
Date
2014
DOI
10.1007/978-3-319-07857-1_89

Metadata
Show full item record
Author
Crawford B.
Soto R.
Olivares-Suárez M.
Paredes F.
Abstract
The Weighted Set Covering Problem is a formal model for many practical optimization problems. In this problem the goal is to choose a subset of columns of minimal cost covering every row. Here, a Binary Firefly Algorithm has been developed to tackle the Weighted Set Covering Problem. Firefly Algorithm is a recently developed population-based metaheuristic inspired by the flashing behaviour of fireflies. Experimental results show that our approach is competitive solving the problem at hand. © Springer International Publishing Switzerland 2014.
Collections