Set covering problem solved by new binary firefly algorithm

Author

Crawford, Broderick ; Soto, Ricardo ; Riquelme-Leiva, Marco ; Pena, Cristian ; Torres-Rojas, Claudio ; Johnson, Franklin ; Paredes, Fernando

Author_Institution

Pontificia Univ. Catolica de Valparaiso, Valparaiso, Chile

fYear

2015

fDate

17-20 June 2015

Firstpage

1

Lastpage

4

Abstract

In this paper, we propose a Modified Binary Firefly Algorithm to solve different instances of the Set Covering Problem (SCP). The Set Covering Problem is considered a classic combinatorial optimization problem, belonging to the class NP-hard problem [8] and have many practical applications. In this paper we consider applying Modified Binary Firefly Algorithm supported in eight Transfer Functions and five Discretization Methods that allow us to express the solution of the problem in the binary domain. The different results presented in this paper show that our algorithm is a good alternative at a low cost to solve the SCP.

Keywords

computational complexity; optimisation; set theory; transfer functions; NP-hard problem; combinatorial optimization problem; discretization method; modified binary firefly algorithm; set covering problem; transfer functions; Computer science; Computers; Mathematical programming; Optimized production technology; Processor scheduling; Transfer functions; Discretization Methods; Modified Binary Firefly Algorithm; NP-hard; Set Covering Problem; Transfer Functions;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Systems and Technologies (CISTI), 2015 10th Iberian Conference on

Conference_Location

Aveiro

Type

conf

DOI

10.1109/CISTI.2015.7170366

Filename

7170366