Mostrar el registro sencillo del ítem

An artificial bee colony algorithm for the set covering problem

dc.contributor.authorCuesta R.
dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:16:07Z
dc.date.available2020-09-02T22:16:07Z
dc.date.issued2014
dc.identifier10.1007/978-3-319-06740-7_5
dc.identifier.citation285, , 53-63
dc.identifier.issn21945357
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4206
dc.descriptionIn this paper, we present a new Artificial Bee Colony algorithm to solve the non-unicost Set Covering Problem. The Artificial Bee Colony algorithm is a recent metaheuristic technique based on the intelligent foraging behavior of honey bee swarm. Computational results show that Artificial Bee Colony algorithm is competitive in terms of solution quality with other metaheuristic approaches for the Set Covering Problem problem. © Springer International Publishing Switzerland 2014.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceSilhavy R.Senkerik R.Oplatkova Z.K.Silhavy P.Prokopova Z.
dc.subjectArtificial bee colony algorithm
dc.subjectCombinatorial optimization
dc.subjectHeuristic
dc.subjectSet covering problem
dc.subjectAlgorithms
dc.subjectCombinatorial optimization
dc.subjectOptimization
dc.subjectSocial networking (online)
dc.subjectArtificial bee colony algorithms
dc.subjectComputational results
dc.subjectForaging behaviors
dc.subjectHeuristic
dc.subjectHoney bee swarms
dc.subjectMeta-heuristic approach
dc.subjectMeta-heuristic techniques
dc.subjectSet covering problem
dc.subjectEvolutionary algorithms
dc.titleAn artificial bee colony algorithm for the set covering problem
dc.typeConference Paper


Ficheros en el ítem

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

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

Mostrar el registro sencillo del ítem