Binarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem [Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto]

dc.creatorCrawford B.
dc.creatorSoto R.
dc.creatorPeña C.
dc.creatorRiquelme-Leiva M.
dc.creatorTorres-Rojas C.
dc.creatorJohnson F.
dc.creatorParedes F.
dc.date.accessioned2020-09-02T22:15:43Z
dc.date.accessioned2022-11-08T20:24:45Z
dc.date.available2020-09-02T22:15:43Z
dc.date.available2022-11-08T20:24:45Z
dc.date.created2020-09-02T22:15:43Z
dc.date.issued2015
dc.identifierhttps://hdl.handle.net/20.500.12728/4168
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5145388
dc.languagees
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.subjectMetaheuristics
dc.subjectSet Covering Problem
dc.subjectShuffled Frog Leaping Algorithm
dc.subjectAlgorithms
dc.subjectBins
dc.subjectDiscrete event simulation
dc.subjectInformation systems
dc.subjectOptimization
dc.subjectBinary representations
dc.subjectDiscretization method
dc.subjectMeta heuristics
dc.subjectMetaheuristic
dc.subjectOptimization problems
dc.subjectSet covering problem
dc.subjectShuffled frog leaping algorithm (SFLA)
dc.subjectSocial behavior
dc.subjectProblem solving
dc.titleBinarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem [Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto]
dc.typeConference Paper


Este ítem pertenece a la siguiente institución