A binary invasiveweed optimization algorithm for the set covering problem

Broderick Crawford, Ricardo Soto, Ismael Fuenzalida Legüe, Eduardo Olguín

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

2 Citas (Scopus)

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 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.

Idioma originalInglés
Título de la publicación alojadaArtificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016
EditoresRadek Silhavy, Roman Senkerik, Zuzana Kominkova Oplatkova, Petr Silhavy, Zdenka Prokopova
EditorialSpringer Verlag
Páginas459-468
Número de páginas10
ISBN (versión impresa)9783319336237
DOI
EstadoPublicada - 2016
Evento5th Computer Science On-line Conference, CSOC 2016 - Prague, República Checa
Duración: 27 abr. 201630 abr. 2016

Serie de la publicación

NombreAdvances in Intelligent Systems and Computing
Volumen464
ISSN (versión impresa)2194-5357

Conferencia

Conferencia5th Computer Science On-line Conference, CSOC 2016
País/TerritorioRepública Checa
CiudadPrague
Período27/04/1630/04/16

Huella

Profundice en los temas de investigación de 'A binary invasiveweed optimization algorithm for the set covering problem'. En conjunto forman una huella única.

Citar esto