Title
A discrete invasive weed optimization algorithm for the set covering problem
Other title
[Algoritmo Discreto de Optimización Hiebras Invasivas para el Set Covering Problem]
Date Issued
25 July 2016
Access level
metadata only access
Resource Type
conference paper
Author(s)
Pontificia Universidad Católica de Valparaiso
Publisher(s)
IEEE Computer Society
Abstract
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.
Volume
2016-July
Language
Spanish
OCDE Knowledge area
Ciencias de la computación
Ecología
Subjects
Scopus EID
2-s2.0-84982104856
Source
Iberian Conference on Information Systems and Technologies, CISTI
Resource of which it is part
Iberian Conference on Information Systems and Technologies, CISTI
ISSN of the container
21660727
ISBN of the container
9789899843462
Conference
11th Iberian Conference on Information Systems and Technologies, CISTI 2016
Sources of information:
Directorio de Producción Científica
Scopus