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

Broderick Crawford; Ricardo Soto; Ismael Fuenzalida Legue; Eduardo Olguin

doi:10.1109/CISTI.2016.7521489

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, Ricardo Soto, Ismael Fuenzalida Legue, Eduardo Olguin

SCHOOL OF COMPUTER ENGINEERING

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 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 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 contribution	A discrete invasive weed optimization algorithm for the set covering problem
Original language	Spanish
Title of host publication	Proceedings of the 11th Iberian Conference on Information Systems and Technologies, CISTI 2016
Editors	Alvaro Rocha, Luis Paulo Reis, Manuel Perez Cota, Ramiro Goncalves, Octavio Santana Suarez
Publisher	IEEE Computer Society
ISBN (Electronic)	9789899843462
DOIs	https://doi.org/10.1109/CISTI.2016.7521489
State	Published - 25 Jul 2016
Event	11th Iberian Conference on Information Systems and Technologies, CISTI 2016 - Gran Canaria, Spain Duration: 15 Jun 2016 → 18 Jun 2016

Publication series

Name	Iberian Conference on Information Systems and Technologies, CISTI
Volume	2016-July
ISSN (Print)	2166-0727
ISSN (Electronic)	2166-0735

Conference

Conference	11th Iberian Conference on Information Systems and Technologies, CISTI 2016
Country/Territory	Spain
City	Gran Canaria
Period	15/06/16 → 18/06/16

Access to Document

10.1109/CISTI.2016.7521489

Cite this

Crawford, B., Soto, R., Legue, I. F., & Olguin, E. (2016). Algoritmo Discreto de Optimización Hiebras Invasivas para el Set Covering Problem. In A. Rocha, L. P. Reis, M. P. Cota, R. Goncalves, & O. S. Suarez (Eds.), Proceedings of the 11th Iberian Conference on Information Systems and Technologies, CISTI 2016 Article 7521489 (Iberian Conference on Information Systems and Technologies, CISTI; Vol. 2016-July). IEEE Computer Society. https://doi.org/10.1109/CISTI.2016.7521489

Crawford, Broderick ; Soto, Ricardo ; Legue, Ismael Fuenzalida et al. / Algoritmo Discreto de Optimización Hiebras Invasivas para el Set Covering Problem. Proceedings of the 11th Iberian Conference on Information Systems and Technologies, CISTI 2016. editor / Alvaro Rocha ; Luis Paulo Reis ; Manuel Perez Cota ; Ramiro Goncalves ; Octavio Santana Suarez. IEEE Computer Society, 2016. (Iberian Conference on Information Systems and Technologies, CISTI).

@inproceedings{b1c8c4ee82fd4b4fabaac1c7bc8148df,

title = "Algoritmo Discreto de Optimizaci{\'o}n Hiebras Invasivas para el Set Covering Problem",

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

keywords = "Binary Invasive Weed, Invasive Weed Optimization, Metaheuristics, Set Covering Problem",

author = "Broderick Crawford and Ricardo Soto and Legue, {Ismael Fuenzalida} and Eduardo Olguin",

note = "Publisher Copyright: {\textcopyright} 2016 AISTI.; 11th Iberian Conference on Information Systems and Technologies, CISTI 2016 ; Conference date: 15-06-2016 Through 18-06-2016",

year = "2016",

month = jul,

day = "25",

doi = "10.1109/CISTI.2016.7521489",

language = "Spanish",

series = "Iberian Conference on Information Systems and Technologies, CISTI",

publisher = "IEEE Computer Society",

editor = "Alvaro Rocha and Reis, {Luis Paulo} and Cota, {Manuel Perez} and Ramiro Goncalves and Suarez, {Octavio Santana}",

booktitle = "Proceedings of the 11th Iberian Conference on Information Systems and Technologies, CISTI 2016",

}

Crawford, B , Soto, R, Legue, IF & Olguin, E 2016, Algoritmo Discreto de Optimización Hiebras Invasivas para el Set Covering Problem. in A Rocha, LP Reis, MP Cota, R Goncalves & OS Suarez (eds), Proceedings of the 11th Iberian Conference on Information Systems and Technologies, CISTI 2016., 7521489, Iberian Conference on Information Systems and Technologies, CISTI, vol. 2016-July, IEEE Computer Society, 11th Iberian Conference on Information Systems and Technologies, CISTI 2016, Gran Canaria, Spain, 15/06/16. https://doi.org/10.1109/CISTI.2016.7521489

Algoritmo Discreto de Optimización Hiebras Invasivas para el Set Covering Problem. / Crawford, Broderick ; Soto, Ricardo; Legue, Ismael Fuenzalida et al.
Proceedings of the 11th Iberian Conference on Information Systems and Technologies, CISTI 2016. ed. / Alvaro Rocha; Luis Paulo Reis; Manuel Perez Cota; Ramiro Goncalves; Octavio Santana Suarez. IEEE Computer Society, 2016. 7521489 (Iberian Conference on Information Systems and Technologies, CISTI; Vol. 2016-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Legue, Ismael Fuenzalida

AU - Olguin, Eduardo

PY - 2016/7/25

Y1 - 2016/7/25

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

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

KW - Binary Invasive Weed

KW - Invasive Weed Optimization

KW - Metaheuristics

KW - Set Covering Problem

UR - http://www.scopus.com/inward/record.url?scp=84982104856&partnerID=8YFLogxK

U2 - 10.1109/CISTI.2016.7521489

DO - 10.1109/CISTI.2016.7521489

M3 - Conference contribution

AN - SCOPUS:84982104856

T3 - Iberian Conference on Information Systems and Technologies, CISTI

BT - Proceedings of the 11th Iberian Conference on Information Systems and Technologies, CISTI 2016

A2 - Rocha, Alvaro

A2 - Reis, Luis Paulo

A2 - Cota, Manuel Perez

A2 - Goncalves, Ramiro

A2 - Suarez, Octavio Santana

PB - IEEE Computer Society

T2 - 11th Iberian Conference on Information Systems and Technologies, CISTI 2016

Y2 - 15 June 2016 through 18 June 2016

ER -

Crawford B , Soto R, Legue IF, Olguin E. Algoritmo Discreto de Optimización Hiebras Invasivas para el Set Covering Problem. In Rocha A, Reis LP, Cota MP, Goncalves R, Suarez OS, editors, Proceedings of the 11th Iberian Conference on Information Systems and Technologies, CISTI 2016. IEEE Computer Society. 2016. 7521489. (Iberian Conference on Information Systems and Technologies, CISTI). doi: 10.1109/CISTI.2016.7521489

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this