Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings

DOI10.1016/J.EJOR.2005.01.017zbMath1116.90039OpenAlexW2021993623MaRDI QIDQ819106

Aaron Luntala Nsakanda, Moustapha Diaby, Wilson L. Price

Publication date: 22 March 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.01.017

zbMATH Keywords

large-scale optimizationDantzig-Wolfe decompositiongenetic algorithmcellular manufacturing systemsalternate routings

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (11)

Dynamic cellular manufacturing system design considering alternative routing and part operation tradeoff using simulated annealing based genetic algorithm ⋮ A price-directed decomposition approach for solving large-scale capacitated part-routing problems ⋮ Ensuring population diversity in genetic algorithms: a technical note with application to the cell formation problem ⋮ APPLYING SIMULATED ANNEALING TO A GENERALIZED CELL FORMATION PROBLEM CONSIDERING ALTERNATIVE ROUTINGS AND MACHINE RELIABILITY ⋮ A genetic algorithm heuristic approach to general outsourcing capacitated production planning problems ⋮ SOME UNDERLYING MATHEMATICAL DEFINITIONS AND PRINCIPLES FOR CELLULAR MANUFACTURING ⋮ The evolution of cell formation problem methodologies based on recent studies (1997-2008): Review and directions for future research ⋮ Cellular manufacturing systems design with routing flexibility, machine procurement, production planning and dynamic system reconfiguration ⋮ Integrated cellular manufacturing systems design with production planning and dynamic system reconfiguration ⋮ A SIMULATED ANNEALING FOR INTRA-CELL LAYOUT DESIGN OF DYNAMIC CELLULAR MANUFACTURING SYSTEMS WITH ROUTE SELECTION, PURCHASING MACHINES AND CELL RECONFIGURATION ⋮ Machine-part cell formation using biclustering

Cites Work

• Unnamed Item
• Ensuring population diversity in genetic algorithms: a technical note with application to the cell formation problem
• Selection of parts and machines for cellularization: A mathematical programming approach
• Partial termination rule of Lagrangian relaxation for manufacturing cell formation problems
• Efficient solutions to the cell-formation problem with multiple routings via a double-loop genetic algorithm
• On cell size and machine requirements planning in group technology systems
• An integrated formulation of manufacturing cell formation with capacity planning and multiple routings
• Stepwise decomposition approaches for large scale cell formation problems
• An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
• Design of cellular manufacturing systems
• Cellular manufacturing at 46 user plants: Implementation experiences and performance improvements
• A genetic algorithm for manufacturing cell formation with multiple routes and multiple objectives
• Cell design and loading in the presence of alternative routing

This page was built for publication: Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings