Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem

Vista sencilla de ítem
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorGalleguillos, C.es_ES
dc.contributor.authorBarraza J.es_ES
dc.contributor.authorLizama S.es_ES
dc.contributor.authorMuñoz A.es_ES
dc.contributor.authorVilches J.es_ES
dc.contributor.authorMisra, S.es_ES
dc.contributor.authorParedes, F.es_ES
dc.date.accessioned6/22/2022 14:20
dc.date.accessioned2022-06-22T20:03:33Z
dc.date.available6/22/2022 14:20
dc.date.available2022-06-22T20:03:33Z
dc.date.issued2015
dc.description.abstractThe set covering problem is a classical model in the subject of combinatorial optimization for service allocation, that consists in finding a set of solutions for covering a range of needs at the lowest possible cost. In this paper, we report various approximate methods to solve this problem, such as Cuckoo Search, Bee Colony, Firefly Optimization, and Electromagnetism-Like Algorithms. We illustrate experimental results of these metaheuristics for solving a set of 65 non-unicost set covering problems from the Beasley’s OR-Library. © Springer International Publishing Switzerland 2015.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1007/978-3-319-21404-7_14es_ES
dc.identifier.urihttps://doi.org/10.1007/978-3-319-21404-7_14
dc.language.isoen_USes_ES
dc.publisherSpringer Verlages_ES
dc.publisher.countryDEes_ES
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)es_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)es_ES
dc.subjectComputer Sciencees_ES
dc.subjectMathematicses_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#2.02.04es_ES
dc.titleComparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problemes_ES
dc.typeinfo:eu-repo/semantics/conferenceObjectes_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
36. Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms....pdf
Tamaño:
281.07 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Ponencia de congreso