Mostrar el registro sencillo del ítem

A black hole algorithm for solving the set covering problem

dc.contributor.authorSoto R.
dc.contributor.authorCrawford B.
dc.contributor.authorFigueroa I.
dc.contributor.authorNiklander S.
dc.contributor.authorOlguín E.
dc.date.accessioned2020-09-02T22:28:40Z
dc.date.available2020-09-02T22:28:40Z
dc.date.issued2016
dc.identifier10.1007/978-3-319-42007-3_72
dc.identifier.citation9799, , 855-861
dc.identifier.issn03029743
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6295
dc.descriptionThe set covering problem is a classical optimization benchmark with many industrial applications such as production planning, assembly line balancing, and crew scheduling among several others. In this work, we solve such a problem by employing a recent nature-inspired metaheuristic based on the black hole phenomena. The core of such a metaheuristic is enhanced with the incorporation of transfer functions and discretization methods to handle the binary nature of the problem. We illustrate encouraging experimental results, where the proposed approach is capable to reach various global optimums for a well-known instance set from the Beasley’s OR-Library. © Springer International Publishing Switzerland 2016.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceAli M.Fujita H.Sasaki J.Kurematsu M.Selamat A.
dc.subjectBlack Hole algorithm
dc.subjectMeta-heuristics
dc.subjectSet covering problem
dc.subjectSoft computing
dc.subjectAlgorithms
dc.subjectBenchmarking
dc.subjectDiscrete event simulation
dc.subjectGravitation
dc.subjectIntelligent systems
dc.subjectKnowledge based systems
dc.subjectOptimization
dc.subjectProduction control
dc.subjectSoft computing
dc.subjectStars
dc.subjectAlgorithm for solving
dc.subjectAssembly line balancing
dc.subjectBlack holes
dc.subjectClassical optimization
dc.subjectDiscretization method
dc.subjectMeta heuristics
dc.subjectProduction Planning
dc.subjectSet covering problem
dc.subjectProblem solving
dc.titleA black hole algorithm for solving the set covering problem
dc.typeConference Paper


Ficheros en el ítem

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

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

Mostrar el registro sencillo del ítem