Show simple item record

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorGuzmán N.
dc.contributor.authorJohnson F.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:15:37Z
dc.date.available2020-09-02T22:15:37Z
dc.date.issued2015
dc.identifier10.1007/978-3-319-21380-4_96
dc.identifier.citation528, , 567-572
dc.identifier.issn18650929
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4133
dc.descriptionThe Set Covering Problem (SCP) has long been concentrating the interest of many researchers in the field of Combinatorial Optimization. SCP is a 0–1 integer programming problem that consists in finding a set of solutions which allow to cover a set of needs at the lowest cost possible. There are many applications of these kind of problems, the main ones are: location of services, files selection in a data bank, simplification of boolean expressions, balancing production lines, among others. Different metaheuristics have been proposed to solve it. Here, we present the possibilities to solve Set Covering Problems with Harmony Search. © Springer International Publishing Switzerland 2015.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceStephanidis C.
dc.subjectHarmony search algorithm
dc.subjectMetaheuristics
dc.subjectSet covering problem
dc.subjectAlgorithms
dc.subjectCombinatorial optimization
dc.subjectFactory automation
dc.subjectHeuristic algorithms
dc.subjectHuman computer interaction
dc.subjectInteger programming
dc.subjectLearning algorithms
dc.subjectOptimization
dc.subjectBoolean expressions
dc.subjectHarmony search
dc.subjectHarmony search algorithms
dc.subjectInteger programming problems
dc.subjectMeta heuristics
dc.subjectOptimization problems
dc.subjectProduction line
dc.subjectSet covering problem
dc.subjectProblem solving
dc.titleRecent harmony search algorithms for 0–1 optimization problems
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record