Solving set covering problem with fireworks explosion

Broderick Crawford; Ricardo Soto; Gonzalo Astudillo; Eduardo Olguín; Sanjay Misra

doi:10.1007/978-3-319-42085-1_21

Solving set covering problem with fireworks explosion

Broderick Crawford, Ricardo Soto, Gonzalo Astudillo, Eduardo Olguín, Sanjay Misra

SCHOOL OF COMPUTER ENGINEERING

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

3 Scopus citations

Abstract

To solve the Set Covering Problem we will use a metaheuristic Fireworks Algorithm inspired by the fireworks explosion. Through the observation of the way that fireworks explode is much similar to the way that an individual searches the optimal solution in swarm. Fireworks algorithm (FWA) consists of four parts, i.e., the explosion operator, the mutation operator, the mapping rule and selection strategy. The Set Covering Problem is a formal model for many practical optimization problems. It consists in finding a subset of columns in a zero/one matrix such that they cover all the rows of the matrix at a minimum cost.

Original language	English
Title of host publication	Computational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings
Editors	Bernady O. Apduhan, Beniamino Murgante, Sanjay Misra, David Taniar, Carmelo M. Torre, Ana Maria A.C. Rocha, Shangguang Wang, Osvaldo Gervasi, Elena Stankova
Publisher	Springer Verlag
Pages	273-283
Number of pages	11
ISBN (Print)	9783319420844
DOIs	https://doi.org/10.1007/978-3-319-42085-1_21
State	Published - 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	9786
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

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

Keywords

Firework algorithm
Metaheuristic
Set covering problem

Access to Document

10.1007/978-3-319-42085-1_21

Cite this

Crawford, B., Soto, R., Astudillo, G., Olguín, E., & Misra, S. (2016). Solving set covering problem with fireworks explosion. In B. O. Apduhan, B. Murgante, S. Misra, D. Taniar, C. M. Torre, A. M. A. C. Rocha, S. Wang, O. Gervasi, & E. Stankova (Eds.), Computational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings (pp. 273-283). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9786). Springer Verlag. https://doi.org/10.1007/978-3-319-42085-1_21

Crawford, Broderick ; Soto, Ricardo ; Astudillo, Gonzalo et al. / Solving set covering problem with fireworks explosion. Computational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings. editor / Bernady O. Apduhan ; Beniamino Murgante ; Sanjay Misra ; David Taniar ; Carmelo M. Torre ; Ana Maria A.C. Rocha ; Shangguang Wang ; Osvaldo Gervasi ; Elena Stankova. Springer Verlag, 2016. pp. 273-283 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{27c8c100b5484d95aebd2fda9e5b6809,

title = "Solving set covering problem with fireworks explosion",

abstract = "To solve the Set Covering Problem we will use a metaheuristic Fireworks Algorithm inspired by the fireworks explosion. Through the observation of the way that fireworks explode is much similar to the way that an individual searches the optimal solution in swarm. Fireworks algorithm (FWA) consists of four parts, i.e., the explosion operator, the mutation operator, the mapping rule and selection strategy. The Set Covering Problem is a formal model for many practical optimization problems. It consists in finding a subset of columns in a zero/one matrix such that they cover all the rows of the matrix at a minimum cost.",

keywords = "Firework algorithm, Metaheuristic, Set covering problem",

author = "Broderick Crawford and Ricardo Soto and Gonzalo Astudillo and Eduardo Olgu{\'i}n and Sanjay Misra",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 16th International Conference on Computational Science and Its Applications, ICCSA 2016 ; Conference date: 04-07-2016 Through 07-07-2016",

year = "2016",

doi = "10.1007/978-3-319-42085-1_21",

language = "English",

isbn = "9783319420844",

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

publisher = "Springer Verlag",

pages = "273--283",

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

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

}

Crawford, B , Soto, R, Astudillo, G, Olguín, E & Misra, S 2016, Solving set covering problem with fireworks explosion. in BO Apduhan, B Murgante, S Misra, D Taniar, CM Torre, AMAC Rocha, S Wang, O Gervasi & E Stankova (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. 9786, Springer Verlag, pp. 273-283, 16th International Conference on Computational Science and Its Applications, ICCSA 2016, Beijing, China, 4/07/16. https://doi.org/10.1007/978-3-319-42085-1_21

Solving set covering problem with fireworks explosion. / Crawford, Broderick ; Soto, Ricardo; Astudillo, Gonzalo et al.
Computational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings. ed. / Bernady O. Apduhan; Beniamino Murgante; Sanjay Misra; David Taniar; Carmelo M. Torre; Ana Maria A.C. Rocha; Shangguang Wang; Osvaldo Gervasi; Elena Stankova. Springer Verlag, 2016. p. 273-283 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9786).

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

TY - GEN

T1 - Solving set covering problem with fireworks explosion

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Astudillo, Gonzalo

AU - Olguín, Eduardo

AU - Misra, Sanjay

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

PY - 2016

Y1 - 2016

N2 - To solve the Set Covering Problem we will use a metaheuristic Fireworks Algorithm inspired by the fireworks explosion. Through the observation of the way that fireworks explode is much similar to the way that an individual searches the optimal solution in swarm. Fireworks algorithm (FWA) consists of four parts, i.e., the explosion operator, the mutation operator, the mapping rule and selection strategy. The Set Covering Problem is a formal model for many practical optimization problems. It consists in finding a subset of columns in a zero/one matrix such that they cover all the rows of the matrix at a minimum cost.

AB - To solve the Set Covering Problem we will use a metaheuristic Fireworks Algorithm inspired by the fireworks explosion. Through the observation of the way that fireworks explode is much similar to the way that an individual searches the optimal solution in swarm. Fireworks algorithm (FWA) consists of four parts, i.e., the explosion operator, the mutation operator, the mapping rule and selection strategy. The Set Covering Problem is a formal model for many practical optimization problems. It consists in finding a subset of columns in a zero/one matrix such that they cover all the rows of the matrix at a minimum cost.

KW - Firework algorithm

KW - Metaheuristic

KW - Set covering problem

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

U2 - 10.1007/978-3-319-42085-1_21

DO - 10.1007/978-3-319-42085-1_21

M3 - Conference contribution

AN - SCOPUS:84978821920

SN - 9783319420844

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

SP - 273

EP - 283

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

A2 - Apduhan, Bernady O.

A2 - Murgante, Beniamino

A2 - Misra, Sanjay

A2 - Taniar, David

A2 - Torre, Carmelo M.

A2 - Rocha, Ana Maria A.C.

A2 - Wang, Shangguang

A2 - Gervasi, Osvaldo

A2 - Stankova, Elena

PB - Springer Verlag

T2 - 16th International Conference on Computational Science and Its Applications, ICCSA 2016

Y2 - 4 July 2016 through 7 July 2016

ER -

Crawford B , Soto R, Astudillo G, Olguín E, Misra S. Solving set covering problem with fireworks explosion. In Apduhan BO, Murgante B, Misra S, Taniar D, Torre CM, Rocha AMAC, Wang S, Gervasi O, Stankova E, editors, Computational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings. Springer Verlag. 2016. p. 273-283. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-42085-1_21

Solving set covering problem with fireworks explosion

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this