A comparison of three recent nature-inspired metaheuristics for the set covering problem

Vista sencilla de ítem
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorPeña, C.es_ES
dc.contributor.authorRiquelme-Leiva, M.es_ES
dc.contributor.authorTorres-Rojas, C.es_ES
dc.contributor.authorMisra, S.es_ES
dc.contributor.authorJohnson, F.es_ES
dc.contributor.authorParedes, F.es_ES
dc.date.accessioned6/22/2022 14:20
dc.date.accessioned2022-06-22T19:51:06Z
dc.date.available6/22/2022 14:20
dc.date.available2022-06-22T19:51:06Z
dc.date.issued2015
dc.description.abstractThe Set Covering Problem (SCP) is a classic problem in combinatorial optimization. SCP has many applications in engineering, including problems involving routing, scheduling, stock cutting, electoral redistricting and others important real life situations. Because of its importance, SCP has attracted attention of many researchers. However, SCP instances are known as complex and generally NP-hard problems. Due to the combinatorial nature of this problem, during the last decades, several metaheuristics have been applied to obtain efficient solutions. This paper presents a metaheuristics comparison for the SCP. Three recent nature-inspired metaheuristics are considered: Shuffled Frog Leaping, Firefly and Fruit Fly algorithms. The results show that they can obtainn optimal or close to optimal solutions at low computational cost. © Springer International Publishing Switzerland 2015.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1007/978-3-319-21410-834es_ES
dc.identifier.urihttps://link.springer.com/chapter/10.1007/978-3-319-21410-8_34es_PE
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.titleA comparison of three recent nature-inspired metaheuristics for 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:
8. A comparison of three recent nature-inspired metaheuristics for the set covering problem.pdf
Tamaño:
578.29 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Ponencia de congreso