A binary invasiveweed optimization algorithm for the set covering problem

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

doi:10.1007/978-3-319-33625-1_41

A binary invasiveweed optimization algorithm for the set covering problem

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

SCHOOL OF COMPUTER ENGINEERING

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016
Editors	Radek Silhavy, Roman Senkerik, Zuzana Kominkova Oplatkova, Petr Silhavy, Zdenka Prokopova
Publisher	Springer Verlag
Pages	459-468
Number of pages	10
ISBN (Print)	9783319336237
DOIs	https://doi.org/10.1007/978-3-319-33625-1_41
State	Published - 2016
Event	5th Computer Science On-line Conference, CSOC 2016 - Prague, Czech Republic Duration: 27 Apr 2016 → 30 Apr 2016

Publication series

Name	Advances in Intelligent Systems and Computing
Volume	464
ISSN (Print)	2194-5357

Conference

Conference	5th Computer Science On-line Conference, CSOC 2016
Country/Territory	Czech Republic
City	Prague
Period	27/04/16 → 30/04/16

Keywords

Binary invasive weed
Invasive weed optimization
Metaheuristics
Set covering problem

Access to Document

10.1007/978-3-319-33625-1_41

Cite this

Crawford, B., Soto, R., Legüe, I. F., & Olguín, E. (2016). A binary invasiveweed optimization algorithm for the set covering problem. In R. Silhavy, R. Senkerik, Z. K. Oplatkova, P. Silhavy, & Z. Prokopova (Eds.), Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016 (pp. 459-468). (Advances in Intelligent Systems and Computing; Vol. 464). Springer Verlag. https://doi.org/10.1007/978-3-319-33625-1_41

Crawford, Broderick ; Soto, Ricardo ; Legüe, Ismael Fuenzalida et al. / A binary invasiveweed optimization algorithm for the set covering problem. Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016. editor / Radek Silhavy ; Roman Senkerik ; Zuzana Kominkova Oplatkova ; Petr Silhavy ; Zdenka Prokopova. Springer Verlag, 2016. pp. 459-468 (Advances in Intelligent Systems and Computing).

@inproceedings{822d40ad62fe433aa72ea7eb5a33d0e7,

title = "A binary invasiveweed optimization algorithm for the 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 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.",

keywords = "Binary invasive weed, Invasive weed optimization, Metaheuristics, Set covering problem",

author = "Broderick Crawford and Ricardo Soto and Leg{\"u}e, {Ismael Fuenzalida} and Eduardo Olgu{\'i}n",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 5th Computer Science On-line Conference, CSOC 2016 ; Conference date: 27-04-2016 Through 30-04-2016",

year = "2016",

doi = "10.1007/978-3-319-33625-1_41",

language = "English",

isbn = "9783319336237",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Verlag",

pages = "459--468",

editor = "Radek Silhavy and Roman Senkerik and Oplatkova, {Zuzana Kominkova} and Petr Silhavy and Zdenka Prokopova",

booktitle = "Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016",

}

Crawford, B , Soto, R, Legüe, IF & Olguín, E 2016, A binary invasiveweed optimization algorithm for the set covering problem. in R Silhavy, R Senkerik, ZK Oplatkova, P Silhavy & Z Prokopova (eds), Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016. Advances in Intelligent Systems and Computing, vol. 464, Springer Verlag, pp. 459-468, 5th Computer Science On-line Conference, CSOC 2016, Prague, Czech Republic, 27/04/16. https://doi.org/10.1007/978-3-319-33625-1_41

A binary invasiveweed optimization algorithm for the set covering problem. / Crawford, Broderick ; Soto, Ricardo; Legüe, Ismael Fuenzalida et al.
Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016. ed. / Radek Silhavy; Roman Senkerik; Zuzana Kominkova Oplatkova; Petr Silhavy; Zdenka Prokopova. Springer Verlag, 2016. p. 459-468 (Advances in Intelligent Systems and Computing; Vol. 464).

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

TY - GEN

T1 - A binary invasiveweed optimization algorithm for the set covering problem

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Legüe, Ismael Fuenzalida

AU - Olguín, Eduardo

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2016.

PY - 2016

Y1 - 2016

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

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

KW - Binary invasive weed

KW - Invasive weed optimization

KW - Metaheuristics

KW - Set covering problem

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

U2 - 10.1007/978-3-319-33625-1_41

DO - 10.1007/978-3-319-33625-1_41

M3 - Conference contribution

AN - SCOPUS:84964780720

SN - 9783319336237

T3 - Advances in Intelligent Systems and Computing

SP - 459

EP - 468

BT - Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016

A2 - Silhavy, Radek

A2 - Senkerik, Roman

A2 - Oplatkova, Zuzana Kominkova

A2 - Silhavy, Petr

A2 - Prokopova, Zdenka

PB - Springer Verlag

T2 - 5th Computer Science On-line Conference, CSOC 2016

Y2 - 27 April 2016 through 30 April 2016

ER -

Crawford B , Soto R, Legüe IF, Olguín E. A binary invasiveweed optimization algorithm for the set covering problem. In Silhavy R, Senkerik R, Oplatkova ZK, Silhavy P, Prokopova Z, editors, Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016. Springer Verlag. 2016. p. 459-468. (Advances in Intelligent Systems and Computing). doi: 10.1007/978-3-319-33625-1_41

A binary invasiveweed optimization algorithm for the set covering problem

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this