Binary harmony search algorithm for solving set-covering problem
| dc.contributor.author | Salas, J. | es_ES |
| dc.contributor.author | Crawford, B. | es_ES |
| dc.contributor.author | Soto, R. | es_ES |
| dc.contributor.author | Rubio Á.G. | es_ES |
| dc.contributor.author | Jaramillo, A. | es_ES |
| dc.contributor.author | Mansilla Villablanca, S. | es_ES |
| dc.contributor.author | Olguín, E. | es_ES |
| dc.date.accessioned | 6/22/2022 14:20 | |
| dc.date.accessioned | 2022-06-22T20:03:32Z | |
| dc.date.available | 6/22/2022 14:20 | |
| dc.date.available | 2022-06-22T20:03:32Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | This paper is intended to generate solutions to Set Covering Problem (SCP) through the use of a metaheuristic. The results were obtained using a variation of Harmony Search called Binary Global-Best Harmony Search Algorithm. To measure the effectiveness of the technique against other metaheuristics, Weasly benchmark was used. © Springer International Publishing Switzerland 2016. | es_ES |
| dc.format | application/pdf | es_ES |
| dc.identifier.doi | 10.1007/978-3-319-42007-3_78 | es_ES |
| dc.identifier.uri | https://doi.org/10.1007/978-3-319-42007-3_78 | |
| dc.language.iso | en_US | es_ES |
| dc.publisher | Springer Verlag | es_ES |
| dc.publisher.country | DE | es_ES |
| dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | es_ES |
| dc.rights | info:eu-repo/semantics/closedAccess | es_ES |
| dc.source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | es_ES |
| dc.subject | Computer Science | es_ES |
| dc.subject | Mathematics | es_ES |
| dc.subject.ocde | http://purl.org/pe-repo/ocde/ford#2.02.04 | es_ES |
| dc.title | Binary harmony search algorithm for solving set-covering problem | es_ES |
| dc.type | info:eu-repo/semantics/conferenceObject | es_ES |
| dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
Archivos
Bloque original
1 - 1 de 1
Cargando...
- Nombre:
- 29. Binary harmony search algorithm for solving set-covering problem.pdf
- Tamaño:
- 1.55 MB
- Formato:
- Adobe Portable Document Format