Algoritmo Discreto de Optimización Hiebras Invasivas para el Set Covering Problem

Translated title of the contribution: A discrete invasive weed optimization algorithm for the set covering problem

BRODERICK CRAWFORD LABRIN, RICARDO JAVIER SOTO DE GIORGIS, Ismael Fuenzalida Legue, Eduardo Olguin

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

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 Invasive Weed Optimization (IWO), in its binary version; Binary Invasive Weed Optimization (BIWO). IWO, it is to imitate to Invasive Weed behavior (reproduction and selection natural), through mathematics formulations. Where the best weed has more chance of reproduction.

Translated title of the contributionA discrete invasive weed optimization algorithm for the set covering problem
Original languageSpanish
Title of host publicationProceedings of the 11th Iberian Conference on Information Systems and Technologies, CISTI 2016
EditorsAlvaro Rocha, Luis Paulo Reis, Manuel Perez Cota, Ramiro Goncalves, Octavio Santana Suarez
PublisherIEEE Computer Society
ISBN (Electronic)9789899843462
DOIs
StatePublished - 25 Jul 2016
Event11th Iberian Conference on Information Systems and Technologies, CISTI 2016 - Gran Canaria, Spain
Duration: 15 Jun 201618 Jun 2016

Publication series

NameIberian Conference on Information Systems and Technologies, CISTI
Volume2016-July
ISSN (Print)2166-0727
ISSN (Electronic)2166-0735

Conference

Conference11th Iberian Conference on Information Systems and Technologies, CISTI 2016
CountrySpain
CityGran Canaria
Period15/06/1618/06/16

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

Cite this