Mostrar el registro sencillo del ítem

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorPeña C.
dc.contributor.authorPalma W.
dc.contributor.authorJohnson F.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:15:43Z
dc.date.available2020-09-02T22:15:43Z
dc.date.issued2015
dc.identifier10.1007/978-3-319-15705-4_5
dc.identifier.citation9012, , 41-50
dc.identifier.issn03029743
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4167
dc.descriptionIn this paper we design and evaluate a shuffled frog leaping algorithm that solves the set covering problem. The shuffled frog leaping algorithm is a novel metaheuristic inspired by natural memetics. It consists of an individual memetic evolution and a global memetic information exchange between a population of virtual frogs representing possible solutions of a problem at hand. The experimental results show the effectiveness of our approach which produces competitive results solving a portfolio of set covering problems from the OR-Library. © Springer International Publishing Switzerland 2015.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceNguyen N.T.Trawinski B.Nguyen N.T.Kosala R.
dc.subjectArtificial and computational intelligence
dc.subjectMetaheuristics
dc.subjectSet covering problem
dc.subjectShuffled frog leaping algorithm
dc.subjectArtificial intelligence
dc.subjectDatabase systems
dc.subjectFactory automation
dc.subjectInformation exchanges
dc.subjectMemetic
dc.subjectMemetic evolutions
dc.subjectMemetics
dc.subjectMeta heuristics
dc.subjectMetaheuristic
dc.subjectSet covering problem
dc.subjectShuffled frog leaping algorithm (SFLA)
dc.subjectAlgorithms
dc.titleSolving the set covering problem with a shuffled frog leaping algorithm
dc.typeConference Paper


Ficheros en el ítem

Thumbnail

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

Mostrar el registro sencillo del ítem