Title
An binary black hole algorithm to solve set covering problem
Date Issued
01 January 2016
Resource Type
Book Series
Author(s)
Rubio Á.
Crawford B.
Jaramillo A.
Villablanca S.
Salas J.
Olguín E.
Abstract
The set covering problem (SCP) is one of the most representative combinatorial optimization problems and it has multiple applications in different situations of engineering, sciences and some other disciplines. It aims to find a set of solutions that meet the needs defined in the constraints having lowest possible cost. In this paper we used an existing binary algorithm inspired by Binary Black Holes (BBH), to solve multiple instances of the problem with known benchmarks obtained from the OR-library. The presented method emulates the behavior of these celestial bodies using a rotation operator to bring good solutions. After tray this algorithm, we implemented some improvements in certain operators, as well as added others also inspired by black holes physical behavior, to optimize the search and exploration to improving the results.
Start page
873
End page
883
Volume
9799
Scopus EID
2-s2.0-84978829330
ISBN
9783319420066
Source
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Resource of which it is part
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN of the container
03029743
Sources of information: Directorio de Producción Científica Scopus