Title
A weed colonization inspired algorithm for the weighted set cover problem
Date Issued
01 January 2016
Access level
metadata only access
Resource Type
conference paper
Author(s)
Publisher(s)
Springer Verlag
Abstract
The Weighted Set Cover Problem (SCP) is a popular optimization problem that has been applied to different industrial applications, including scheduling, manufacturing, service planning and location problems. It consists in to find low cost solutions covering a set of requirements or needs. In this paper, we solve the SCP using a recent nature inspired algorithm: Invasive Weed Optimization (IWO). IWO imitates the invasive behavior of real weeds: natural reproduction and selection where the best weed has more chance of reproduction. We test our approach using known ORLIB test problems for the SCP. The computational results show that the IWO metaheuristic can find very good results.
Start page
129
End page
138
Volume
9790
Language
English
OCDE Knowledge area
Ingeniería de materiales
Ingeniería industrial
Subjects
Scopus EID
2-s2.0-84978194036
ISBN
9783319420912
Source
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Resource of which it is part
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN of the container
03029743
ISBN of the container
978-331942091-2
Conference
16th International Conference on Computational Science and Its Applications, ICCSA 2016
Sponsor(s)
Fondo Nacional de Desarrollo Científico y Tecnológico - FONDECYT
Sources of information:
Directorio de Producción Científica
Scopus