TY - JOUR

T1 - A binary coded firefly algorithm that solves the set covering problem

AU - CRAWFORD LABRIN, BRODERICK

AU - SOTO DE GIORGIS, RICARDO JAVIER

AU - Olivares-Suárez, Miguel

AU - PALMA MUÑOZ, WENCESLAO ENRIQUE

AU - Paredes, Fernando

AU - Olguín, Eduardo

AU - Norero, Enrique

PY - 2014/1/1

Y1 - 2014/1/1

N2 - This work presents a study of a new binary coded firefly algorithm. The firefly algorithm is a novel nature-inspired metaheuristic, inspired by the social behavior of fireflies, which is being applied to solve many optimization problems. We test the proposed binary coded firefly algorithm solving the non-unicost set covering problem which is a well-known NP-hard discrete optimization problem with many practical applications. To tackle the mapping from a continuous search space to a discrete search space we use different transfer functions which are investigated in terms of convergence speed and accuracy of results. The experimental results show the effectiveness of our approach where the binary coded firefly algorithm produce competitive results solving a portfolio of set covering problems from the OR-Library.

AB - This work presents a study of a new binary coded firefly algorithm. The firefly algorithm is a novel nature-inspired metaheuristic, inspired by the social behavior of fireflies, which is being applied to solve many optimization problems. We test the proposed binary coded firefly algorithm solving the non-unicost set covering problem which is a well-known NP-hard discrete optimization problem with many practical applications. To tackle the mapping from a continuous search space to a discrete search space we use different transfer functions which are investigated in terms of convergence speed and accuracy of results. The experimental results show the effectiveness of our approach where the binary coded firefly algorithm produce competitive results solving a portfolio of set covering problems from the OR-Library.

KW - Binary firefly algorithm

KW - Metaheuristic

KW - Set covering problem

UR - http://www.scopus.com/inward/record.url?scp=84929623628&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84929623628

VL - 17

SP - 252

EP - 264

JO - Romanian Journal of Information Science and Technology

JF - Romanian Journal of Information Science and Technology

SN - 1453-8245

IS - 3

ER -