Title
A binary invasiveweed optimization algorithm for the set covering problem
Date Issued
01 January 2016
Access level
metadata only access
Resource Type
book part
Author(s)
Publisher(s)
Springer Verlag
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 InvasiveWeed Optimization (IWO), in its binary version; Binary InvasiveWeed Optimization (BIWO). IWO, it is to imitate to InvasiveWeed behavior (reproduction and selection natural), through mathematics formulations. Where the best weed has more chance of reproduction.
Start page
459
End page
468
Volume
464
Language
English
OCDE Knowledge area
Electroquímica
Hardware, Arquitectura de computadoras
Subjects
Scopus EID
2-s2.0-84964780720
Source
Advances in Intelligent Systems and Computing
Resource of which it is part
Advances in Intelligent Systems and Computing
ISSN of the container
21945357
ISBN of the container
978-331933623-7
Conference
5th Computer Science On-line Conference, CSOC 2016
Sources of information:
Directorio de Producción Científica
Scopus