A Multi Dynamic Binary Black Hole Algorithm Applied to Set Covering Problem

2017 ◽  
pp. 42-51 ◽  
Author(s):  
José García ◽  
Broderick Crawford ◽  
Ricardo Soto ◽  
Pablo García
Keyword(s):  
Black Hole ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Binary Black Hole ◽  
Black Hole Algorithm

An Binary Black Hole Algorithm to Solve Set Covering Problem

2016 ◽  
pp. 873-883 ◽  
Author(s):  
Álvaro Gómez Rubio ◽  
Broderick Crawford ◽  
Ricardo Soto ◽  
Adrián Jaramillo ◽  
Sebastián Mansilla Villablanca ◽  
...  
Keyword(s):  
Black Hole ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Binary Black Hole ◽  
Black Hole Algorithm

An binary black hole algorithm to solve the set covering problem

2016 ◽  
Author(s):  
Alvaro Gomez ◽  
Broderick Crawford ◽  
Ricardo Soto ◽  
Adrian Jaramillo ◽  
Sebastian Mansilla ◽  
...  
Keyword(s):  
Black Hole ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Binary Black Hole ◽  
Black Hole Algorithm

scholarly journals Adaptive Black Hole Algorithm for Solving the Set Covering Problem

2018 ◽  
Vol 2018 ◽  
pp. 1-23 ◽  
Author(s):  
Ricardo Soto ◽  
Broderick Crawford ◽  
Rodrigo Olivares ◽  
Carla Taramasco ◽  
Ignacio Figueroa ◽  
...  
Keyword(s):  
Black Hole ◽  
Optimization Problems ◽  
Main Idea ◽  
Industrial Applications ◽  
Set Covering ◽  
Covering Problem ◽  
Problem Solver ◽  
Set Covering Problem ◽  
A New Technique ◽  
Black Hole Algorithm

Evolutionary algorithms have been used to solve several optimization problems, showing an efficient performance. Nevertheless, when these algorithms are applied they present the difficulty to decide on the appropriate values of their parameters. Typically, parameters are specified before the algorithm is run and include population size, selection rate, and operator probabilities. This process is known as offline control and is even considered as an optimization problem in itself. On the other hand, parameter settings or control online is a variation of the algorithm original version. The main idea is to vary the parameters so that the algorithm of interest can provide the best convergence rate and thus may achieve the best performance. In this paper, we propose an adaptive black hole algorithm able to dynamically adapt its population according to solving performance. For that, we use autonomous search which appeared as a new technique that enables the problem solver to control and adapt its own parameters and heuristics during solving in order to be more efficient without the knowledge of an expert user. In order to test this approach, we resolve the set covering problem which is a classical optimization benchmark with many industrial applications such as line balancing production, crew scheduling, service installation, and databases, among several others. We illustrate encouraging experimental results, where the proposed approach is able to reach various global optimums for a well-known instance set from Beasley’s OR-Library, while improving various modern metaheuristics.

The set covering problem solved by the Black Hole Algorithm

2016 ◽  
Author(s):  
Ricardo Soto ◽  
Broderick Crawford ◽  
Ignacio Figueroa ◽  
Rodrigo Olivares ◽  
Eduardo Olguin
Keyword(s):  
Black Hole ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Black Hole Algorithm

A Black Hole Algorithm for Solving the Set Covering Problem

2016 ◽  
pp. 855-861
Author(s):  
Ricardo Soto ◽  
Broderick Crawford ◽  
Ignacio Figueroa ◽  
Stefanie Niklander ◽  
Eduardo Olguín
Keyword(s):  
Black Hole ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Black Hole Algorithm

Solving the Set Covering Problem with a Binary Black Hole Inspired Algorithm

2016 ◽  
pp. 207-219 ◽  
Author(s):  
Álvaro Gómez Rubio ◽  
Broderick Crawford ◽  
Ricardo Soto ◽  
Eduardo Olguín ◽  
Sanjay Misra ◽  
...  
Keyword(s):  
Black Hole ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Binary Black Hole

Comparing the Black Hole and the Soccer League Competition Algorithms Solving the Set Covering Problem

Polibits ◽  
2018 ◽  
Vol 57 ◽  
pp. 5-17
Author(s):  
Adrián Jaramillo ◽  
Álvaro Gómez ◽  
Broderick Crawford ◽  
Ricardo Soto ◽  
Fernando Paredes ◽  
...  
Keyword(s):  
Black Hole ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem

Solving the non-unicost set covering problem by using cuckoo search and black hole optimization

2017 ◽  
Vol 16 (2) ◽  
pp. 213-229 ◽  
Author(s):  
Ricardo Soto ◽  
Broderick Crawford ◽  
Rodrigo Olivares ◽  
Jorge Barraza ◽  
Ignacio Figueroa ◽  
...  
Keyword(s):  
Black Hole ◽  
Cuckoo Search ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Unicost Set Covering Problem

A new approach using a Binary Firefly Algorithm for the Set Covering Problem

2014 ◽  
Author(s):  
Broderick Crawford ◽  
Ricardo Soto ◽  
Miguel Olivares-Suárez ◽  
Fernando Paredes
Keyword(s):  
Firefly Algorithm ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
New Approach
Sign in / Sign up

Export Citation Format

Share Document