Article ID: | iaor20117049 |
Volume: | 45 |
Issue: | 7 |
Start Page Number: | 991 |
End Page Number: | 1003 |
Publication Date: | Aug 2011 |
Journal: | Transportation Research Part B |
Authors: | Ouyang Yanfeng, Li Xiaopeng, Chen Qi |
Keywords: | inventory: storage, programming: integer |
This paper studies a reliable joint inventory‐location problem that optimizes facility locations, customer allocations, and inventory management decisions when facilities are subject to disruption risks (e.g., due to natural or man‐made hazards). When a facility fails, its customers may be reassigned to other operational facilities in order to avoid the high penalty costs associated with losing service. We propose an integer programming model that minimizes the sum of facility construction costs, expected inventory holding costs and expected customer costs under normal and failure scenarios. We develop a Lagrangian relaxation solution framework for this problem, including a polynomial‐time exact algorithm for the relaxed nonlinear subproblems. Numerical experiment results show that this proposed model is capable of providing a near‐optimum solution within a short computation time. Managerial insights on the optimal facility deployment, inventory control strategies, and the corresponding cost constitutions are drawn.