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

Matias Valenzuela, Alvaro Pena, Luis Lopez, Hernan Pinto

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

5 Citas (Scopus)

Resumen

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.

Idioma originalInglés
Título de la publicación alojada2017 4th International Conference on Systems and Informatics, ICSAI 2017
EditorialInstitute of Electrical and Electronics Engineers Inc.
Páginas513-518
Número de páginas6
ISBN (versión digital)9781538611074
DOI
EstadoPublicada - 28 jun. 2017
Publicado de forma externa
Evento4th International Conference on Systems and Informatics, ICSAI 2017 - Hangzhou, China
Duración: 11 nov. 201713 nov. 2017

Serie de la publicación

Nombre2017 4th International Conference on Systems and Informatics, ICSAI 2017
Volumen2018-January

Conferencia

Conferencia4th International Conference on Systems and Informatics, ICSAI 2017
País/TerritorioChina
CiudadHangzhou
Período11/11/1713/11/17

Huella

Profundice en los temas de investigación de 'A binary multi-verse optimizer algorithm applied to the set covering problem'. En conjunto forman una huella única.

Citar esto