A binary invasiveweed optimization algorithm for the set covering problem

BRODERICK CRAWFORD LABRIN, RICARDO JAVIER SOTO DE GIORGIS, Ismael Fuenzalida Legüe, Eduardo Olguín

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Original languageEnglish
Title of host publicationArtificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016
EditorsRadek Silhavy, Roman Senkerik, Zuzana Kominkova Oplatkova, Petr Silhavy, Zdenka Prokopova
PublisherSpringer Verlag
Pages459-468
Number of pages10
ISBN (Print)9783319336237
DOIs
StatePublished - 1 Jan 2016
Event5th Computer Science On-line Conference, CSOC 2016 - Prague, Czech Republic
Duration: 27 Apr 201630 Apr 2016

Publication series

NameAdvances in Intelligent Systems and Computing
Volume464
ISSN (Print)2194-5357

Conference

Conference5th Computer Science On-line Conference, CSOC 2016
CountryCzech Republic
CityPrague
Period27/04/1630/04/16

Keywords

  • Binary invasive weed
  • Invasive weed optimization
  • Metaheuristics
  • Set covering problem

Fingerprint Dive into the research topics of 'A binary invasiveweed optimization algorithm for the set covering problem'. Together they form a unique fingerprint.

Cite this