Mostrar el registro sencillo del ítem

A XOR-based ABC algorithm for solving set covering problems

dc.contributor.authorSoto R.
dc.contributor.authorCrawford B.
dc.contributor.authorLizama S.
dc.contributor.authorJohnson F.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:28:41Z
dc.date.available2020-09-02T22:28:41Z
dc.date.issued2016
dc.identifier10.1007/978-3-319-26690-9_19
dc.identifier.citation407, , 209-218
dc.identifier.issn21945357
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6308
dc.descriptionThe 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.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceHassanien A.E.El-Bendary N.Gaber T.Dey N.
dc.subjectArtificial bee colony algorithm
dc.subjectBio-inspired systems
dc.subjectMetaheuristics
dc.subjectSet covering problem
dc.subjectAlgorithms
dc.subjectBins
dc.subjectCombinatorial optimization
dc.subjectEvolutionary algorithms
dc.subjectFactory automation
dc.subjectInformation science
dc.subjectIntelligent systems
dc.subjectOptimization
dc.subjectAbc algorithms
dc.subjectApproximate methods
dc.subjectArtificial bee colony algorithms
dc.subjectBioinspired systems
dc.subjectClassical problems
dc.subjectExact algorithms
dc.subjectMeta heuristics
dc.subjectSet covering problem
dc.subjectProblem solving
dc.titleA XOR-based ABC algorithm for solving set covering problems
dc.typeConference Paper


Ficheros en el ítem

Thumbnail
Nombre:
item_2-s2.0-84952017769.pdf
Tamaño:
2.507Kb
Formato:
PDF
Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem