El Problema de Cobertura de Conjuntos solucionado por el Algoritmo del Agujero Negro

Ricardo Soto, Broderick Crawford, Ignacio Figueroa, Rodrigo Olivares, Eduardo Olguin

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

1 Cita (Scopus)

Resumen

The Set Covering Problem is a classical problem in combinatorial optimization that belongs to the Karp's 21 NP-hard problems, with many practical applications. In this paper, an approach based on Black Hole Algorithm is proposed to solve this problem. The black hole algorithm is a metaheuristic that is inspired by nature, especially by the black hole phenomenon in space. To improve the performance of metaheuristics are used repairing operator, which those solutions that violate the constraints, preprocessing accelerate the resolution of the problem, and transfer function and discretization function to adapts the solutions to a binary domains. We report interesting and competitive experimental results on a set of 45 instances preprocessed the Set Covering Problem.

Título traducido de la contribuciónThe set covering problem solved by the Black Hole Algorithm
Idioma originalEspañol
Título de la publicación alojadaProceedings of the 11th Iberian Conference on Information Systems and Technologies, CISTI 2016
EditoresAlvaro Rocha, Luis Paulo Reis, Manuel Perez Cota, Ramiro Goncalves, Octavio Santana Suarez
EditorialIEEE Computer Society
ISBN (versión digital)9789899843462
DOI
EstadoPublicada - 25 jul. 2016
Evento11th Iberian Conference on Information Systems and Technologies, CISTI 2016 - Gran Canaria, Espana
Duración: 15 jun. 201618 jun. 2016

Serie de la publicación

NombreIberian Conference on Information Systems and Technologies, CISTI
Volumen2016-July
ISSN (versión impresa)2166-0727
ISSN (versión digital)2166-0735

Conferencia

Conferencia11th Iberian Conference on Information Systems and Technologies, CISTI 2016
País/TerritorioEspana
CiudadGran Canaria
Período15/06/1618/06/16

Palabras clave

  • Black hole algorithm
  • optimization problem
  • set covering problem

Huella

Profundice en los temas de investigación de 'El Problema de Cobertura de Conjuntos solucionado por el Algoritmo del Agujero Negro'. En conjunto forman una huella única.

Citar esto