Title: A mixed-integer linear formulation for a capacitated facility location problem in supply chain network design
Authors: Vo Hung Duong; Nguyen Hung Bui
Addresses: School of Industrial Management, Ho Chi Minh City University of Technology, 268 Ly Thuong Kiet St., Dist. 10, Ho Chi Minh City, Vietnam ' School of Industrial Management, Ho Chi Minh City University of Technology, 268 Ly Thuong Kiet St., Dist. 10, Ho Chi Minh City, Vietnam
Abstract: In this research, we deal with a multi-item, multi-period, two-echelon capacitated facility location problem. With every period in horizon planning, manufacturing plants and distribution centres are decided to open or not at predetermined potential sites. The developed model is formulated as a mixed integer linear programming (MILP) model with the objective of minimising the total cost, including transportation cost, inventory holding cost, and fixed costs for opening facilities. We employ a Lagrangian relaxation algorithm for solving the developed model. Before decomposition into sub-problems, the initial structure of developed model is modified, three additional constraint sets add to two sub-problems, and these are the key differences of our algorithm. For validation testing, some numerical experiments are used for solving, and the solutions obtained from the Lagrangian relaxation algorithm are respectively compared with the solutions obtained by the LINGO solver. With good achievements of this research, our proposed model can be applied and the proposed approach is an advantage for getting the specific solutions.
Keywords: logistics; supply chain; mixed integer linear programming; MILP; Lagrangian relaxation; network design.
International Journal of Operational Research, 2018 Vol.33 No.1, pp.32 - 54
Available online: 08 Aug 2018 *Full-text access for editors Access for subscribers Purchase this article Comment on this article