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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 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 languageEnglish
Title of host publication2017 4th International Conference on Systems and Informatics, ICSAI 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages513-518
Number of pages6
ISBN (Electronic)9781538611074
DOIs
StatePublished - 28 Jun 2017
Externally publishedYes
Event4th International Conference on Systems and Informatics, ICSAI 2017 - Hangzhou, China
Duration: 11 Nov 201713 Nov 2017

Publication series

Name2017 4th International Conference on Systems and Informatics, ICSAI 2017
Volume2018-January

Conference

Conference4th International Conference on Systems and Informatics, ICSAI 2017
CountryChina
CityHangzhou
Period11/11/1713/11/17

Fingerprint Dive into the research topics of 'A binary multi-verse optimizer algorithm applied to the set covering problem'. Together they form a unique fingerprint.

Cite this