Heuristics for Base-Stock Levels in Multi-Echelon Distribution Networks with First-Come First Served Policies
Shanghai Jiao Tong University (SJTU) - Antai College of Economics and Management
Eindhoven University of Technology (TUE) - Department of Industrial Engineering and Innovation Sciences
Lawrence V. Snyder
Lehigh University - Department of Industrial and Systems Engineering
December 29, 2013
We study inventory optimization for locally controlled, continuous-review distribution systems with Poisson customer demands. Each node operates a base-stock policy and a first-come, first-served allocation policy. We develop two heuristics, the recursive optimization (RO) heuristic and the decomposition-aggregation (DA) heuristic, to approximate the optimal base-stock levels of all the locations in the system. The RO heuristic applies a bottom-up approach that sequentially solves single-variable, convex problems for each location. The DA heuristic decomposes the distribution system into multiple serial systems, solves for the base-stock levels of these systems using the newsvendor heuristic of Shang and Song (2003), and then aggregates the serial systems back into the distribution system using a procedure we call backorder matching. A key advantage of the DA heuristic is that it does not require any evaluation of the cost function (a computationally costly operation). An extensive numerical study shows that both heuristics perform well, with the RO heuristic providing more accurate results and the DA heuristic consuming less computation time.
Number of Pages in PDF File: 44
Keywords: Multi-Echelon Inventory Control; Distribution Network; One-Warehouse-Multiple-Retailer (OWMR); Serial Supply Chain; Heuristicsworking papers series
Date posted: September 19, 2009 ; Last revised: December 30, 2013
© 2014 Social Science Electronic Publishing, Inc. All Rights Reserved.
This page was processed by apollo8 in 0.453 seconds