Mostrar el registro sencillo del ítem

Binarization methods for shuffled frog leaping algorithms that solve set covering problems

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorPeña C.
dc.contributor.authorRiquelme-Leiva M.
dc.contributor.authorTorres-Rojas C.
dc.contributor.authorJohnson F.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:15:44Z
dc.date.available2020-09-02T22:15:44Z
dc.date.issued2015
dc.identifier10.1007/978-3-319-18473-9_31
dc.identifier.citation349, , 317-326
dc.identifier.issn21945357
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4169
dc.descriptionThis work proposes Shuffled Frog Leaping Algorithms (SFLAs) to solve Set Covering Problems (SCPs). The proposed algorithms include eight transfer function and five discretization methods in order to solve the binary representation of SCP. Different instances of the SetCovering Problem are solved to test our algorithm showing very promising results. © Springer International Publishing Switzerland 2015.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceSilhavy R.Senkerik R.Oplatkova Z.K.Prokopova Z.Silhavy P.
dc.subjectCombinatiorial Optimization
dc.subjectMetaheuristics
dc.subjectSet Covering Problem
dc.subjectShuffled Frog Leaping Algorithm
dc.subjectAlgorithms
dc.subjectBins
dc.subjectDiscrete event simulation
dc.subjectFactory automation
dc.subjectIntelligent systems
dc.subjectSoftware engineering
dc.subjectBinarizations
dc.subjectBinary representations
dc.subjectDiscretization method
dc.subjectMeta heuristics
dc.subjectSet covering problem
dc.subjectSet-covering problems
dc.subjectShuffled frog leaping algorithm (SFLA)
dc.subjectProblem solving
dc.titleBinarization methods for shuffled frog leaping algorithms that solve set covering problems
dc.typeConference Paper


Ficheros en el ítem

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

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

Mostrar el registro sencillo del ítem