Using genetic algorithm to solve dynamic cell formation problem

DOI10.1016/j.apm.2009.07.019zbMath1185.90061MaRDI QIDQ969350

S. M. J. Mirzapour Al-E-Hashem, V. Deljoo, F. Deljoo, Mir-Bahador-Qoli Aryanezhad

Publication date: 6 May 2010

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2009.07.019

zbMATH Keywords

genetic algorithm; dynamic cell formation; meta heuristics

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

90B30: Production models

Related Items

Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing, A SIMULATED ANNEALING FOR INTRA-CELL LAYOUT DESIGN OF DYNAMIC CELLULAR MANUFACTURING SYSTEMS WITH ROUTE SELECTION, PURCHASING MACHINES AND CELL RECONFIGURATION

Cites Work

• Unnamed Item
• Unnamed Item
• A multi-objective scatter search for a dynamic cell formation problem
• A mathematical programming model for system reconfiguration in a dynamic cellular manufacturing environment
• A simulated annealing approach for manufacturing cell formation with multiple identical machines.
• A hybrid simulated annealing for solving an extended model of dynamic cellular manufacturing system
• Solving a dynamic cell formation problem using metaheuristics
• Cellular manufacturing systems design with routing flexibility, machine procurement, production planning and dynamic system reconfiguration
• A new solution for a dynamic cell formation problem with alternative routing and machine costs using simulated annealing