A XOR-based ABC algorithm for solving set covering problems

Vista sencilla de ítem
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorLizama, 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:07Z
dc.date.available6/22/2022 14:20
dc.date.available2022-06-22T19:51:07Z
dc.date.issued2016
dc.description.abstractThe set covering problem is a classical problem in the subject of combinatorial optimization that consists in finding a set of solutions that cover a range of needs at the lowest possible cost. The literature reports various techniques to solve this problem, ranging from exact algorithms to approximate methods. In this paper, we present a new XOR-based artificial bee colony algorithm for solving set covering problems. We integrate a XOR operator to binarize the solution construction in order to cope with the binary nature of set covering problems. We also incorporate pre-processing phases and dynamic ABC parameters so as to improve solving time. We report interesting and competitive experimental results on a set of 65 benchmarks from the Beasley’s OR-Library. © Springer International Publishing Switzerland 2016.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1007/978-3-319-26690-9_19es_ES
dc.identifier.urihttps://doi.org/10.1007/978-3-319-26690-9_19
dc.language.isoen_USes_ES
dc.publisherSpringer Verlages_ES
dc.publisher.countryDEes_ES
dc.relation.ispartofAdvances in Intelligent Systems and Computinges_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.sourceAdvances in Intelligent Systems and Computinges_ES
dc.subjectComputer Sciencees_ES
dc.subjectEngineeringes_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#2.02.04es_ES
dc.titleA XOR-based ABC algorithm for solving set covering problemses_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:
18. A XOR-based ABC algorithm for solving set covering problems.pdf
Tamaño:
167.73 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Ponencia de congreso