A discrete invasive weed optimization algorithm for the set covering problem [Algoritmo Discreto de Optimización Hiebras Invasivas para el Set Covering Problem]
Autor
Crawford B.
Soto R.
Legue I.F.
Olguin E.
Resumen
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.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
Conference Paper
A binary invasiveweed optimization algorithm for the set covering problem (2020)
Crawford B.; Soto R.; Legüe I.F.; Olguín E. (Springer Verlag, 2016) -
Conference Paper
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)
Crawford B.; Soto R.; Leiva F.A.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015) -
Conference Paper
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)
Crawford B.; Soto R.; Peña C.; Riquelme-Leiva M.; Torres-Rojas C.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015)