Mostrar el registro sencillo del ítem

dc.contributor.authorSoto R.
dc.contributor.authorCrawford B.
dc.contributor.authorVega E.
dc.contributor.authorJohnson F.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:28:45Z
dc.date.available2020-09-02T22:28:45Z
dc.date.issued2016
dc.identifier10.1007/978-3-319-26690-9_23
dc.identifier.citation407, , 253-261
dc.identifier.issn21945357
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6332
dc.descriptionThe manufacturing Cell Design Problem (MCDP) is a well-known problem for lines of manufacture where the main goal is to minimize the inter-cell moves. To solve the MCDP we employ the Shuffled Frog Leaping Algorithm (SFLA), which is a metaheuristic inspired on the natural memetic features of frogs. The frog tries to leap all over the search space for a better result until the stopping criteria is met. The obtained results are compared with previous approaches of the algorithm to test the real efficiency of our proposed SFLA. The results show that the proposed algorithm produces optimal solutions for all the 50 studied instances. © Springer International Publishing Switzerland 2016.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceHassanien A.E.El-Bendary N.Gaber T.Dey N.
dc.subjectBio-inspired systems
dc.subjectManufacturing
dc.subjectMetaheuristics
dc.subjectOptimization
dc.subjectAlgorithms
dc.subjectCellular manufacturing
dc.subjectFlexible manufacturing systems
dc.subjectInformation science
dc.subjectIntelligent systems
dc.subjectManufacture
dc.subjectBioinspired systems
dc.subjectInter-cell moves
dc.subjectMeta heuristics
dc.subjectMetaheuristic
dc.subjectOptimal solutions
dc.subjectSearch spaces
dc.subjectShuffled frog leaping algorithm (SFLA)
dc.subjectStopping criteria
dc.subjectOptimization
dc.titleSolving manufacturing cell design problems using 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