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]

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

dc.contributor.author	Crawford B.
dc.contributor.author	Soto R.
dc.contributor.author	Peña C.
dc.contributor.author	Riquelme-Leiva M.
dc.contributor.author	Torres-Rojas C.
dc.contributor.author	Johnson F.
dc.contributor.author	Paredes F.
dc.date.accessioned	2020-09-02T22:15:43Z
dc.date.available	2020-09-02T22:15:43Z
dc.date.issued	2015
dc.identifier	10.1109/CISTI.2015.7170376
dc.identifier.uri	https://hdl.handle.net/20.500.12728/4168
dc.description	This paper presents metaheuristic Shuffled Frog Leaping Algorithm (SFLA) to solve the Set Covering Problem (SCP), the SFLA is inspired by the social behavior of frogs, and is being applied to solve many optimization problems. The proposed algorithm includes eight binarization functions and discretization method for resolving the binary representation of the SCP. In the 65 instances of SCP we obtains very promising results. © 2015 AISTI.
dc.language.iso	es
dc.publisher	Institute of Electrical and Electronics Engineers Inc.
dc.subject	Metaheuristics
dc.subject	Set Covering Problem
dc.subject	Shuffled Frog Leaping Algorithm
dc.subject	Algorithms
dc.subject	Bins
dc.subject	Discrete event simulation
dc.subject	Information systems
dc.subject	Optimization
dc.subject	Binary representations
dc.subject	Discretization method
dc.subject	Meta heuristics
dc.subject	Metaheuristic
dc.subject	Optimization problems
dc.subject	Set covering problem
dc.subject	Shuffled frog leaping algorithm (SFLA)
dc.subject	Social behavior
dc.subject	Problem solving
dc.title	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]
dc.type	Conference Paper

Ficheros en el ítem

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

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]

Ficheros en el ítem

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

Ítems relacionados

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

Binarization methods for shuffled frog leaping algorithms that solve 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) ﻿

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

Binarization methods for shuffled frog leaping algorithms that solve 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)