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

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

Resultado de la investigación: Capítulo del libro/informe/acta de congreso › Contribución a la conferencia › revisión exhaustiva

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

Título traducido de la contribución	A discrete invasive weed optimization algorithm for the set covering problem
Idioma original	Español
Título de la publicación alojada	Proceedings of the 11th Iberian Conference on Information Systems and Technologies, CISTI 2016
Editores	Alvaro Rocha, Luis Paulo Reis, Manuel Perez Cota, Ramiro Goncalves, Octavio Santana Suarez
Editorial	IEEE Computer Society
ISBN (versión digital)	9789899843462
DOI	https://doi.org/10.1109/CISTI.2016.7521489
Estado	Publicada - 25 jul. 2016
Publicado de forma externa	Sí
Evento	11th Iberian Conference on Information Systems and Technologies, CISTI 2016 - Gran Canaria, Espana Duración: 15 jun. 2016 → 18 jun. 2016

Serie de la publicación

Nombre	Iberian Conference on Information Systems and Technologies, CISTI
Volumen	2016-July
ISSN (versión impresa)	2166-0727
ISSN (versión digital)	2166-0735

Conferencia

Conferencia	11th Iberian Conference on Information Systems and Technologies, CISTI 2016
País/Territorio	Espana
Ciudad	Gran Canaria
Período	15/06/16 → 18/06/16

Palabras clave

Binary Invasive Weed
Invasive Weed Optimization
Metaheuristics
Set Covering Problem

Acceder al documento

10.1109/CISTI.2016.7521489

Otros archivos y enlaces

Enlace a la publicación en Scopus

Citar esto

Crawford, B., Soto, R., Legue, I. F., & Olguin, E. (2016). Algoritmo Discreto de Optimización Hiebras Invasivas para el Set Covering Problem. En 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 [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.; null ; 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. En 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, Espana, 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).

Resultado de la investigación: Capítulo del libro/informe/acta de congreso › Contribución a la conferencia › revisión exhaustiva

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

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. En Rocha A, Reis LP, Cota MP, Goncalves R, Suarez OS, editores, 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

Resumen

Serie de la publicación

Conferencia

Palabras clave

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto