A binary coded firefly algorithm that solves the set covering problem

BRODERICK CRAWFORD LABRIN, RICARDO JAVIER SOTO DE GIORGIS, Miguel Olivares-Suárez, WENCESLAO ENRIQUE PALMA MUÑOZ, Fernando Paredes, Eduardo Olguín, Enrique Norero

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)252-264
Number of pages13
JournalRomanian Journal of Information Science and Technology
Volume17
Issue number3
StatePublished - 1 Jan 2014

Keywords

  • Binary firefly algorithm
  • Metaheuristic
  • Set covering problem

Fingerprint

Dive into the research topics of 'A binary coded firefly algorithm that solves the set covering problem'. Together they form a unique fingerprint.

Cite this