Solving manufacturing cell design problems using a shuffled frog leaping algorithm

Ricardo Soto, Broderick Crawford, Emanuel Vega, Franklin Johnson, Fernando Paredes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

Abstract

The 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.

Original languageEnglish
Title of host publicationThe 1st International Conference on Advanced Intelligent System and Informatics, AISI 2015
EditorsAboul Ella Hassanien, Nashwa El-Bendary, Tarek Gaber, Nilanjan Dey
PublisherSpringer Verlag
Pages253-261
Number of pages9
ISBN (Print)9783319266886
DOIs
StatePublished - 2016
Event1st International Conference on Advanced Intelligent System and Informatics, AISI 2015 - Beni Suef, Egypt
Duration: 28 Nov 201530 Nov 2015

Publication series

NameAdvances in Intelligent Systems and Computing
Volume407
ISSN (Print)2194-5357

Conference

Conference1st International Conference on Advanced Intelligent System and Informatics, AISI 2015
Country/TerritoryEgypt
CityBeni Suef
Period28/11/1530/11/15

Keywords

  • Bio-inspired systems
  • Manufacturing
  • Metaheuristics
  • Optimization

Fingerprint

Dive into the research topics of 'Solving manufacturing cell design problems using a shuffled frog leaping algorithm'. Together they form a unique fingerprint.

Cite this