A discrete invasive weed optimization algorithm for the set covering problem [Algoritmo Discreto de Optimización Hiebras Invasivas para el Set Covering Problem]

Crawford B.; Soto R.; Legue I.F.; Olguin E.

dc.contributor.author	Crawford B.
dc.contributor.author	Soto R.
dc.contributor.author	Legue I.F.
dc.contributor.author	Olguin E.
dc.date.accessioned	2020-09-02T22:15:40Z
dc.date.available	2020-09-02T22:15:40Z
dc.date.issued	2016
dc.identifier	10.1109/CISTI.2016.7521489
dc.identifier.citation	2016-July, , -
dc.identifier.issn	21660727
dc.identifier.uri	https://hdl.handle.net/20.500.12728/4147
dc.description	The Set Covering Problem (SCP) is a classic problem of combinatorial analytic. This problem consists in to find solutions what cover the needs to lower cost. Those can be services to cities, load balancing in production lines or databanks selections. In this paper, we study the resolution of SCP, through Invasive Weed Optimization (IWO), in its binary version; Binary Invasive Weed Optimization (BIWO). IWO, it is to imitate to Invasive Weed behavior (reproduction and selection natural), through mathematics formulations. Where the best weed has more chance of reproduction. © 2016 AISTI.
dc.language.iso	es
dc.publisher	IEEE Computer Society
dc.source	Rocha A.Reis L.P.Cota M.P.Goncalves R.Suarez O.S.
dc.subject	Binary Invasive Weed
dc.subject	Invasive Weed Optimization
dc.subject	Metaheuristics
dc.subject	Set Covering Problem
dc.subject	Algorithms
dc.subject	Bins
dc.subject	Information systems
dc.subject	Network management
dc.subject	Databanks
dc.subject	Invasive weed
dc.subject	Invasive weed optimization
dc.subject	Invasive Weed Optimization algorithms
dc.subject	Mathematics formulations
dc.subject	Meta heuristics
dc.subject	Production line
dc.subject	Set covering problem
dc.subject	Optimization
dc.title	A discrete invasive weed optimization algorithm for the set covering problem [Algoritmo Discreto de Optimización Hiebras Invasivas para el Set Covering Problem]
dc.type	Conference Paper

Ficheros en el ítem

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

A discrete invasive weed optimization algorithm for the set covering problem [Algoritmo Discreto de Optimización Hiebras Invasivas para el Set Covering Problem]

Ficheros en el ítem

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

Ítems relacionados

A binary invasiveweed optimization algorithm for the set covering problem (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) ﻿

A binary invasiveweed optimization algorithm for the set covering problem (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)