Show simple item record

dc.contributor.authorSalas J.
dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorRubio Á.G.
dc.contributor.authorJaramillo A.
dc.contributor.authorMansilla Villablanca S.
dc.contributor.authorOlguín E.
dc.date.accessioned2020-09-02T22:27:38Z
dc.date.available2020-09-02T22:27:38Z
dc.date.issued2016
dc.identifier10.1007/978-3-319-42007-3_78
dc.identifier.citation9799, , 917-930
dc.identifier.issn03029743
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6146
dc.descriptionThis paper is intended to generate solutions to Set Covering Problem (SCP) through the use of a metaheuristic. The results were obtained using a variation of Harmony Search called Binary Global-Best Harmony Search Algorithm. To measure the effectiveness of the technique against other metaheuristics, Weasly benchmark was used. © Springer International Publishing Switzerland 2016.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceAli M.Fujita H.Sasaki J.Kurematsu M.Selamat A.
dc.subjectBinary harmony search
dc.subjectMetaheuristics
dc.subjectSet covering problem
dc.subjectAlgorithms
dc.subjectBins
dc.subjectHeuristic algorithms
dc.subjectIntelligent systems
dc.subjectKnowledge based systems
dc.subjectLearning algorithms
dc.subjectHarmony search
dc.subjectHarmony search algorithms
dc.subjectMeta heuristics
dc.subjectMetaheuristic
dc.subjectSet covering problem
dc.subjectProblem solving
dc.titleBinary harmony search algorithm for solving set-covering problem
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record