A binary multi-verse optimizer algorithm applied to the set covering problem

Matias Valenzuela; Alvaro Pena; Luis Lopez; Hernan Pinto

doi:10.1109/ICSAI.2017.8248346

A binary multi-verse optimizer algorithm applied to the set covering problem

Matias Valenzuela, Alvaro Pena, Luis Lopez, Hernan Pinto

SCHOOL OF CONSTRUCTION ENGINEERING

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

6 Scopus citations

Abstract

Many problems addressed in operational research are combinatorial and NP-hard type. Therefore, designing binary algorithms based on swarm intelligence continuous metaheuristics is an area of interest in operational research. In this paper we use a general binarization mechanism based on the percentile concept. We apply the percentile concept to multi-verse optimizer algorithm to solve set covering problem (SCP). Experiments are designed to demonstrate the utility of the percentile concept in binarization. Additionally we verify the efficiency of our algorithm through benchmark instances, showing that Binary multi-verse Optimizer (BMVO) obtains adequate results when it is evaluated against another state of the art algorithm.

Original language	English
Title of host publication	2017 4th International Conference on Systems and Informatics, ICSAI 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	513-518
Number of pages	6
ISBN (Electronic)	9781538611074
DOIs	https://doi.org/10.1109/ICSAI.2017.8248346
State	Published - 28 Jun 2017
Event	4th International Conference on Systems and Informatics, ICSAI 2017 - Hangzhou, China Duration: 11 Nov 2017 → 13 Nov 2017

Publication series

Name	2017 4th International Conference on Systems and Informatics, ICSAI 2017
Volume	2018-January

Conference

Conference	4th International Conference on Systems and Informatics, ICSAI 2017
Country/Territory	China
City	Hangzhou
Period	11/11/17 → 13/11/17

Access to Document

10.1109/ICSAI.2017.8248346

Cite this

Valenzuela, M., Pena, A., Lopez, L., & Pinto, H. (2017). A binary multi-verse optimizer algorithm applied to the set covering problem. In 2017 4th International Conference on Systems and Informatics, ICSAI 2017 (pp. 513-518). (2017 4th International Conference on Systems and Informatics, ICSAI 2017; Vol. 2018-January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICSAI.2017.8248346

@inproceedings{ff418eb6de7945d78cdaab826fd15a84,

title = "A binary multi-verse optimizer algorithm applied to the set covering problem",

abstract = "Many problems addressed in operational research are combinatorial and NP-hard type. Therefore, designing binary algorithms based on swarm intelligence continuous metaheuristics is an area of interest in operational research. In this paper we use a general binarization mechanism based on the percentile concept. We apply the percentile concept to multi-verse optimizer algorithm to solve set covering problem (SCP). Experiments are designed to demonstrate the utility of the percentile concept in binarization. Additionally we verify the efficiency of our algorithm through benchmark instances, showing that Binary multi-verse Optimizer (BMVO) obtains adequate results when it is evaluated against another state of the art algorithm.",

author = "Matias Valenzuela and Alvaro Pena and Luis Lopez and Hernan Pinto",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 4th International Conference on Systems and Informatics, ICSAI 2017 ; Conference date: 11-11-2017 Through 13-11-2017",

year = "2017",

month = jun,

day = "28",

doi = "10.1109/ICSAI.2017.8248346",

language = "English",

series = "2017 4th International Conference on Systems and Informatics, ICSAI 2017",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "513--518",

booktitle = "2017 4th International Conference on Systems and Informatics, ICSAI 2017",

}

Valenzuela, M, Pena, A, Lopez, L & Pinto, H 2017, A binary multi-verse optimizer algorithm applied to the set covering problem. in 2017 4th International Conference on Systems and Informatics, ICSAI 2017. 2017 4th International Conference on Systems and Informatics, ICSAI 2017, vol. 2018-January, Institute of Electrical and Electronics Engineers Inc., pp. 513-518, 4th International Conference on Systems and Informatics, ICSAI 2017, Hangzhou, China, 11/11/17. https://doi.org/10.1109/ICSAI.2017.8248346

A binary multi-verse optimizer algorithm applied to the set covering problem. / Valenzuela, Matias; Pena, Alvaro; Lopez, Luis et al.
2017 4th International Conference on Systems and Informatics, ICSAI 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 513-518 (2017 4th International Conference on Systems and Informatics, ICSAI 2017; Vol. 2018-January).

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

TY - GEN

T1 - A binary multi-verse optimizer algorithm applied to the set covering problem

AU - Valenzuela, Matias

AU - Pena, Alvaro

AU - Lopez, Luis

AU - Pinto, Hernan

PY - 2017/6/28

Y1 - 2017/6/28

N2 - Many problems addressed in operational research are combinatorial and NP-hard type. Therefore, designing binary algorithms based on swarm intelligence continuous metaheuristics is an area of interest in operational research. In this paper we use a general binarization mechanism based on the percentile concept. We apply the percentile concept to multi-verse optimizer algorithm to solve set covering problem (SCP). Experiments are designed to demonstrate the utility of the percentile concept in binarization. Additionally we verify the efficiency of our algorithm through benchmark instances, showing that Binary multi-verse Optimizer (BMVO) obtains adequate results when it is evaluated against another state of the art algorithm.

AB - Many problems addressed in operational research are combinatorial and NP-hard type. Therefore, designing binary algorithms based on swarm intelligence continuous metaheuristics is an area of interest in operational research. In this paper we use a general binarization mechanism based on the percentile concept. We apply the percentile concept to multi-verse optimizer algorithm to solve set covering problem (SCP). Experiments are designed to demonstrate the utility of the percentile concept in binarization. Additionally we verify the efficiency of our algorithm through benchmark instances, showing that Binary multi-verse Optimizer (BMVO) obtains adequate results when it is evaluated against another state of the art algorithm.

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

U2 - 10.1109/ICSAI.2017.8248346

DO - 10.1109/ICSAI.2017.8248346

M3 - Conference contribution

AN - SCOPUS:85046655830

T3 - 2017 4th International Conference on Systems and Informatics, ICSAI 2017

SP - 513

EP - 518

BT - 2017 4th International Conference on Systems and Informatics, ICSAI 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 4th International Conference on Systems and Informatics, ICSAI 2017

Y2 - 11 November 2017 through 13 November 2017

ER -

Valenzuela M, Pena A, Lopez L, Pinto H. A binary multi-verse optimizer algorithm applied to the set covering problem. In 2017 4th International Conference on Systems and Informatics, ICSAI 2017. Institute of Electrical and Electronics Engineers Inc. 2017. p. 513-518. (2017 4th International Conference on Systems and Informatics, ICSAI 2017). doi: 10.1109/ICSAI.2017.8248346

A binary multi-verse optimizer algorithm applied to the set covering problem

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this