A weed colonization inspired algorithm for the weighted set cover problem
Autor
Crawford B.
Soto R.
Legüe I.F.
Misra S.
Olguín E.
Resumen
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. © Springer International Publishing Switzerland 2016.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
Conference Paper
Finding solutions of the set covering problem with an Artificial Fish Swarm Algorithm Optimization (2020)
Crawford B.; Soto R.; Olguín E.; Misra S.; Villablanca S.M.; Rubio Á.G.; Jaramillo A.; Salas J. (Springer Verlag, 2016) -
Conference Paper
A nature inspired intelligent water drop algorithm and its application for solving the set covering problem (2020)
Crawford B.; Soto R.; Córdova J.; Olguín E. (Springer Verlag, 2016) -
Conference Paper
An approach to solve the Set Covering Problem with the Soccer League Competition algorithm (2020)
Jaramillo A.; Crawford B.; Soto R.; Misra S.; Olguín E.; Rubio Á.G.; Salas J.; Villablanca S.M. (Springer Verlag, 2016)