Un algoritmo Binario inspirado en hoyos negros para resolver el Problema de la Cobertura [An Binary black hole algorithm to solve the Set Covering problem]
| dc.contributor.author | Gomez A. | es_ES |
| dc.contributor.author | Crawford, B. | es_ES |
| dc.contributor.author | Soto, R. | es_ES |
| dc.contributor.author | Jaramillo, A. | es_ES |
| dc.contributor.author | Mansilla, S. | es_ES |
| dc.contributor.author | Salas, J. | es_ES |
| dc.contributor.author | Olguin, E. | es_ES |
| dc.date.accessioned | 6/22/2022 13:33 | |
| dc.date.accessioned | 2022-09-30T16:31:47Z | |
| dc.date.available | 6/22/2022 13:33 | |
| dc.date.available | 2022-09-30T16:31:47Z | |
| dc.date.issued | 2016 | |
| dc.description.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. © 2016 AISTI. | es_ES |
| dc.format | application/pdf | es_ES |
| dc.identifier.doi | 10.1109/CISTI.2016.7521431 | es_ES |
| dc.identifier.uri | https://doi.org/10.1109/CISTI.2016.7521431 | |
| dc.language.iso | spa | es_ES |
| dc.publisher | IEEE Computer Society | es_ES |
| dc.rights | info:eu-repo/semantics/closedAccess | es_ES |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | es_ES |
| dc.source | Iberian Conference on Information Systems and Technologies, CISTI | es_ES |
| dc.subject | Computer Science | es_ES |
| dc.subject.ocde | http://purl.org/pe-repo/ocde/ford#1.02.01 | es_ES |
| dc.title | Un algoritmo Binario inspirado en hoyos negros para resolver el Problema de la Cobertura [An Binary black hole algorithm to solve the Set Covering problem] | es_ES |
| dc.type | info:eu-repo/semantics/article | es_ES |
| dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
Archivos
Bloque original
1 - 1 de 1
Cargando...
- Nombre:
- Un Algoritmo Binario Inspirado En Hoyos Negros.pdf
- Tamaño:
- 398.13 KB
- Formato:
- Adobe Portable Document Format