A weed colonization inspired algorithm for the weighted set cover problem

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

doi:10.1007/978-3-319-42092-9_11

A weed colonization inspired algorithm for the weighted set cover problem

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

SCHOOL OF COMPUTER ENGINEERING

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

Abstract

The Weighted Set Cover Problem (SCP) is a popular optimization problem that has been applied to different industrial applications, including scheduling, manufacturing, service planning and location problems. It consists in to find low cost solutions covering a set of requirements or needs. In this paper, we solve the SCP using a recent nature inspired algorithm: Invasive Weed Optimization (IWO). IWO imitates the invasive behavior of real weeds: natural reproduction and selection where the best weed has more chance of reproduction. We test our approach using known ORLIB test problems for the SCP. The computational results show that the IWO metaheuristic can find very good results.

Original language	English
Title of host publication	Computational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings
Editors	Sanjay Misra, Osvaldo Gervasi, Carmelo M. Torre, David Taniar, Elena Stankova, Ana Maria A.C. Rocha, Shangguang Wang, Beniamino Murgante, Bernady O. Apduhan
Publisher	Springer Verlag
Pages	129-138
Number of pages	10
ISBN (Print)	9783319420912
DOIs	https://doi.org/10.1007/978-3-319-42092-9_11
State	Published - 1 Jan 2016
Event	16th International Conference on Computational Science and Its Applications, ICCSA 2016 - Beijing, China Duration: 4 Jul 2016 → 7 Jul 2016

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9790
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	16th International Conference on Computational Science and Its Applications, ICCSA 2016
Country	China
City	Beijing
Period	4/07/16 → 7/07/16

Keywords

Combinatorial optimization
Invasive Weed Optimization
Set covering problem

Access to Document

10.1007/978-3-319-42092-9_11

Fingerprint Dive into the research topics of 'A weed colonization inspired algorithm for the weighted set cover problem'. Together they form a unique fingerprint.

Cite this

CRAWFORD LABRIN, BRODERICK., SOTO DE GIORGIS, RICARDO. JAVIER., Legüe, I. F., Misra, S., & Olguín, E. (2016). A weed colonization inspired algorithm for the weighted set cover problem. In S. Misra, O. Gervasi, C. M. Torre, D. Taniar, E. Stankova, A. M. A. C. Rocha, S. Wang, B. Murgante, & B. O. Apduhan (Eds.), Computational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings (pp. 129-138). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9790). Springer Verlag. https://doi.org/10.1007/978-3-319-42092-9_11

CRAWFORD LABRIN, BRODERICK ; SOTO DE GIORGIS, RICARDO JAVIER ; Legüe, Ismael Fuenzalida ; Misra, Sanjay ; Olguín, Eduardo. / A weed colonization inspired algorithm for the weighted set cover problem. Computational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings. editor / Sanjay Misra ; Osvaldo Gervasi ; Carmelo M. Torre ; David Taniar ; Elena Stankova ; Ana Maria A.C. Rocha ; Shangguang Wang ; Beniamino Murgante ; Bernady O. Apduhan. Springer Verlag, 2016. pp. 129-138 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{75e072fa41be46828fafca2a0b8d5a2c,

title = "A weed colonization inspired algorithm for the weighted set cover problem",

abstract = "The Weighted Set Cover Problem (SCP) is a popular optimization problem that has been applied to different industrial applications, including scheduling, manufacturing, service planning and location problems. It consists in to find low cost solutions covering a set of requirements or needs. In this paper, we solve the SCP using a recent nature inspired algorithm: Invasive Weed Optimization (IWO). IWO imitates the invasive behavior of real weeds: natural reproduction and selection where the best weed has more chance of reproduction. We test our approach using known ORLIB test problems for the SCP. The computational results show that the IWO metaheuristic can find very good results.",

keywords = "Combinatorial optimization, Invasive Weed Optimization, Set covering problem",

author = "{CRAWFORD LABRIN}, BRODERICK and {SOTO DE GIORGIS}, {RICARDO JAVIER} and Leg{\"u}e, {Ismael Fuenzalida} and Sanjay Misra and Eduardo Olgu{\'i}n",

year = "2016",

month = jan,

day = "1",

doi = "10.1007/978-3-319-42092-9_11",

language = "English",

isbn = "9783319420912",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "129--138",

editor = "Sanjay Misra and Osvaldo Gervasi and Torre, {Carmelo M.} and David Taniar and Elena Stankova and Rocha, {Ana Maria A.C.} and Shangguang Wang and Beniamino Murgante and Apduhan, {Bernady O.}",

booktitle = "Computational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings",

note = "null ; Conference date: 04-07-2016 Through 07-07-2016",

}

CRAWFORD LABRIN, BRODERICK , SOTO DE GIORGIS, RICARDOJAVIER, Legüe, IF, Misra, S & Olguín, E 2016, A weed colonization inspired algorithm for the weighted set cover problem. in S Misra, O Gervasi, CM Torre, D Taniar, E Stankova, AMAC Rocha, S Wang, B Murgante & BO Apduhan (eds), Computational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9790, Springer Verlag, pp. 129-138, 16th International Conference on Computational Science and Its Applications, ICCSA 2016, Beijing, China, 4/07/16. https://doi.org/10.1007/978-3-319-42092-9_11

A weed colonization inspired algorithm for the weighted set cover problem. / CRAWFORD LABRIN, BRODERICK ; SOTO DE GIORGIS, RICARDO JAVIER; Legüe, Ismael Fuenzalida; Misra, Sanjay; Olguín, Eduardo.

Computational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings. ed. / Sanjay Misra; Osvaldo Gervasi; Carmelo M. Torre; David Taniar; Elena Stankova; Ana Maria A.C. Rocha; Shangguang Wang; Beniamino Murgante; Bernady O. Apduhan. Springer Verlag, 2016. p. 129-138 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9790).

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

TY - GEN

T1 - A weed colonization inspired algorithm for the weighted set cover problem

AU - CRAWFORD LABRIN, BRODERICK

AU - SOTO DE GIORGIS, RICARDO JAVIER

AU - Legüe, Ismael Fuenzalida

AU - Misra, Sanjay

AU - Olguín, Eduardo

PY - 2016/1/1

Y1 - 2016/1/1

N2 - The Weighted Set Cover Problem (SCP) is a popular optimization problem that has been applied to different industrial applications, including scheduling, manufacturing, service planning and location problems. It consists in to find low cost solutions covering a set of requirements or needs. In this paper, we solve the SCP using a recent nature inspired algorithm: Invasive Weed Optimization (IWO). IWO imitates the invasive behavior of real weeds: natural reproduction and selection where the best weed has more chance of reproduction. We test our approach using known ORLIB test problems for the SCP. The computational results show that the IWO metaheuristic can find very good results.

AB - The Weighted Set Cover Problem (SCP) is a popular optimization problem that has been applied to different industrial applications, including scheduling, manufacturing, service planning and location problems. It consists in to find low cost solutions covering a set of requirements or needs. In this paper, we solve the SCP using a recent nature inspired algorithm: Invasive Weed Optimization (IWO). IWO imitates the invasive behavior of real weeds: natural reproduction and selection where the best weed has more chance of reproduction. We test our approach using known ORLIB test problems for the SCP. The computational results show that the IWO metaheuristic can find very good results.

KW - Combinatorial optimization

KW - Invasive Weed Optimization

KW - Set covering problem

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

U2 - 10.1007/978-3-319-42092-9_11

DO - 10.1007/978-3-319-42092-9_11

M3 - Conference contribution

AN - SCOPUS:84978194036

SN - 9783319420912

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 129

EP - 138

BT - Computational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings

A2 - Misra, Sanjay

A2 - Gervasi, Osvaldo

A2 - Torre, Carmelo M.

A2 - Taniar, David

A2 - Stankova, Elena

A2 - Rocha, Ana Maria A.C.

A2 - Wang, Shangguang

A2 - Murgante, Beniamino

A2 - Apduhan, Bernady O.

PB - Springer Verlag

Y2 - 4 July 2016 through 7 July 2016

ER -

CRAWFORD LABRIN BRODERICK , SOTO DE GIORGIS RICARDOJAVIER, Legüe IF, Misra S, Olguín E. A weed colonization inspired algorithm for the weighted set cover problem. In Misra S, Gervasi O, Torre CM, Taniar D, Stankova E, Rocha AMAC, Wang S, Murgante B, Apduhan BO, editors, Computational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings. Springer Verlag. 2016. p. 129-138. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-42092-9_11

A weed colonization inspired algorithm for the weighted set cover problem

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Cite this