Modified binary firefly algorithms with different transfer functions for solving set covering problems

Crawford B.; Soto R.; Riquelme-Leiva M.; Peña C.; Torres-Rojas C.; Johnson F.; Paredes F.

dc.contributor.author	Crawford B.
dc.contributor.author	Soto R.
dc.contributor.author	Riquelme-Leiva M.
dc.contributor.author	Peña C.
dc.contributor.author	Torres-Rojas C.
dc.contributor.author	Johnson F.
dc.contributor.author	Paredes F.
dc.date.accessioned	2020-09-02T22:16:07Z
dc.date.available	2020-09-02T22:16:07Z
dc.date.issued	2015
dc.identifier	10.1007/978-3-319-18473-9_30
dc.identifier.citation	349, , 307-315
dc.identifier.issn	21945357
dc.identifier.uri	https://hdl.handle.net/20.500.12728/4204
dc.description	In this paper, we propose a set of Modified Binary Firefly Algorithms (MBFF) to solve different instances of the Set Covering Problem (SCP). The algorithms consider eight Transfer Functions and five Discretization Methods in order to solve the binary representation of SCP. The results obtained show that our algorithms are a good and cheap alternative to solve the problem at hand. © Springer International Publishing Switzerland 2015.
dc.language.iso	en
dc.publisher	Springer Verlag
dc.source	Silhavy R.Senkerik R.Oplatkova Z.K.Prokopova Z.Silhavy P.
dc.subject	Combinatorial Optimization
dc.subject	Metaheuristics
dc.subject	Modified Binary FireFly Algorithm
dc.subject	Set Covering Problem
dc.subject	Algorithms
dc.subject	Bins
dc.subject	Bioluminescence
dc.subject	Combinatorial optimization
dc.subject	Discrete event simulation
dc.subject	Factory automation
dc.subject	Intelligent systems
dc.subject	Optimization
dc.subject	Software engineering
dc.subject	Transfer functions
dc.subject	Binary representations
dc.subject	Discretization method
dc.subject	Firefly algorithms
dc.subject	Meta heuristics
dc.subject	Set covering problem
dc.subject	Solving Set
dc.subject	Problem solving
dc.title	Modified binary firefly algorithms with different transfer functions for solving set covering problems
dc.type	Conference Paper

Ficheros en el ítem

Nombre:: item_2-s2.0-84942756744.pdf
Tamaño:: 2.357Kb
Formato:: PDF

Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Artículos científicos

Mostrar el registro sencillo del ítem

Repositorio Académico

Modified binary firefly algorithms with different transfer functions for solving set covering problems

Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

Ítems relacionados

Binarization methods for shuffled frog leaping algorithms that solve set covering problems (2020) ﻿

Set covering problem solved by new binary firefly algorithm [Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario] (2020) ﻿

Binarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem [Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto] (2020) ﻿

Binarization methods for shuffled frog leaping algorithms that solve set covering problems (2020)

Set covering problem solved by new binary firefly algorithm [Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario] (2020)

Binarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem [Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto] (2020)