|Title:||Solving a multi-objective master planning problem with substitution and a recycling process for a capacitated multi-commodity supply chain network||Authors:||Lei, Seak Tou
|Keywords:||Advanced planning and scheduling | Heuristic algorithm | Master planning | Multiple-goal optimization | Recycle process | Recycling penalty | Substitutions | Supply chain management||Issue Date:||1-Feb-2014||Publisher:||SPRINGER||Journal Volume:||25||Journal Issue:||1||Start page/Pages:||1-25||Source:||Journal of Intelligent Manufacturing||Abstract:||
This study focuses on solving the multi-objective master planning problem for supply chains by considering product structures with multiple final products using substitutions, common components, and recycled components. This study considers five objectives in the planning process: (1) minimizing the delay cost, (2) minimizing the substitution priority, (3) minimizing the recycling penalty, (4) minimizing the substitution cost, and (5) minimizing the cost of production, processing, inventory holding and transportation. This study proposes a heuristic algorithm, called the GA-based Master Planning Algorithm (GAMPA), to solve the supply-chain master planning problem efficiently and effectively. GAMPA first transforms the closed-loop supply chain into an open-loop supply chain that plans and searches the sub-networks for each final product. GAMPA then uses a genetic algorithm to sort and sequence the demands. GAMPA selects the chromosome that generates the best planning result according to the priority of the objectives. GAMPA plans each demand sequentially according to the selected chromosome and a randomly-selected production tree. GAMPA tries different production trees for each demand and selects the best planning result at the end. To show the effectiveness and efficiency of GAMPA, a prototype was constructed and tested using complexity analysis and computational analysis to demonstrate the power of GAMPA. © 2012 Springer Science+Business Media, LLC.
|Appears in Collections:||工業工程學研究所|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.