Collaborative Planning in Supply Chains by Lagrangian Relaxation and Genetic Algorithms

Abstract

A collaborative planning framework combining the Lagrangian relaxation method and genetic algorithms is developed to coordinate and optimize the production planning of the independent partners linked by material flows in multiple tier supply chains. Linking constraints and dependent demand constraints were added to the monolithic multi-level, multi-item capacitated lot sizing problem (MLCLSP) for supply chains. Model MLCLSP was Lagrangian relaxed and decomposed into facility-separable sub-problems. Genetic algorithms was incorporated into Lagrangian relaxation method to update Lagrangian multipliers, which coordinated decentralized decisions of the facilities in supply chains. Production planning of independent partners could be appropriately coordinated and optimized by this framework without intruding their decision authorities and private information. This collaborative planning scheme was applied to a large set problem in supply chain production planning. Experimental results show that the proposed coordination mechanism and procedure come close to optimal results as obtained by central coordination in terms of both performance and robustness

DOI: 10.1142/S0219622008002879

3 Figures and Tables

Cite this paper

@article{Nie2006CollaborativePI, title={Collaborative Planning in Supply Chains by Lagrangian Relaxation and Genetic Algorithms}, author={Lanshun Nie and Xiaofei Xu and De-chen Zhan}, journal={2006 6th World Congress on Intelligent Control and Automation}, year={2006}, volume={2}, pages={7258-7262} }