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

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:09Z
dc.date.available	2020-09-02T22:16:09Z
dc.date.issued	2015
dc.identifier	10.1109/CISTI.2015.7170366
dc.identifier.uri	https://hdl.handle.net/20.500.12728/4215
dc.description	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. © 2015 AISTI.
dc.language.iso	es
dc.publisher	Institute of Electrical and Electronics Engineers Inc.
dc.subject	Discretization Methods
dc.subject	Modified Binary Firefly Algorithm
dc.subject	NP-hard
dc.subject	Set Covering Problem
dc.subject	Transfer Functions
dc.subject	Bins
dc.subject	Bioluminescence
dc.subject	Combinatorial optimization
dc.subject	Computational complexity
dc.subject	Discrete event simulation
dc.subject	Information systems
dc.subject	Optimization
dc.subject	Transfer functions
dc.subject	Volume measurement
dc.subject	Combinatorial optimization problems
dc.subject	Discretization method
dc.subject	Firefly algorithms
dc.subject	Low costs
dc.subject	NP-hard
dc.subject	Set covering problem
dc.subject	Algorithms
dc.title	Set covering problem solved by new binary firefly algorithm [Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario]
dc.type	Conference Paper

Ficheros en el ítem

Nombre:: item_2-s2.0-84943328998.pdf
Tamaño:: 2.479Kb
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

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

Ficheros en el ítem

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

Ítems relacionados

Modified binary firefly algorithms with different transfer functions for solving set covering problems (2020) ﻿

The set covering problem solved by the binary teaching-learning-based optimization algorithm [Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje] (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) ﻿

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

The set covering problem solved by the binary teaching-learning-based optimization algorithm [Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje] (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)