Coping with Disruptions

In real-time distribution operations, it is generally assumed that demand process parameters can be precisely estimated. However, this is rarely the case, particularly for products with a short life cycle. Experiments were done to investigate the performance of various strategies for online distribution operations under disruptions caused by surges in demand patterns at a particular facility. Two sets of strategies are considered: (a) optimization-based strategies, in which an off-line optimization problem is formulated and used to update routing and inventory allocation plans, and (b) fixed-tour strategies, in which a priori sets of routes to provide retailers with recourse actions depending on different degrees of real-time information capabilities for controlling the system are used. These are compared against two benchmark policies. Simulation results for two scenarios (high and low inventory holding cost products) show that strategies that use real-time information to update delivery plans systematically outperform strategies in which routes are not modified after the vehicle leaves the depot. The differences tend to be higher in scenarios of products with low inventory holding costs. For replanning strategies, the benefits of en route plan updates are significant, in particular the possibility of diverting the vehicle. In the case of fixed-tour strategies, the possibility of updating tour intervals provides potentially great savings. Replanning strategies systematically outperform fixed-tour strategies.

[1]  Christopher S. Tang Robust strategies for mitigating supply chain disruptions , 2006 .

[2]  M. Fisher What is the Right Supply Chain for Your Product , 1997 .

[3]  Hani S. Mahmassani,et al.  Strategies for Online Inventory Routing Problem under Real-Time Information , 2005 .

[4]  Hani S. Mahmassani,et al.  Logistics in Real-Time: Inventory-Routing Operations under Stochastic Demand: Lecture Notes in Economics and Mathematical Systems , 2009 .

[5]  Awi Federgruen,et al.  Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy , 1991, Oper. Res..

[6]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[7]  Martin W. P. Savelsbergh,et al.  Inventory Routing in Practice , 2002, The Vehicle Routing Problem.

[8]  Hau L. Lee The triple-A supply chain. , 2004, Harvard business review.

[9]  Ricardo Giesen Online Inventory Replenishment and Fleet Routing Decisions under Real-Time Information , 2007 .

[10]  Walter Ukovich,et al.  Dynamic routing-and-inventory problems: a review , 1998 .

[11]  M. Savelsbergh,et al.  The Inventory Routing Problem , 1998 .

[12]  Luca Bertazzi,et al.  Deterministic Order-Up-To Level Policies in an Inventory Routing Problem , 2002, Transp. Sci..

[13]  Srinivasan Raghunathan,et al.  Retailer- vs. Vendor-Managed Inventory and Brand Competition , 2004, Manag. Sci..

[14]  Robert Moore,et al.  Inventory Decisions in Dell's Supply Chain , 2004, Interfaces.

[15]  Yossi Sheffi,et al.  The Resilient Enterprise: Overcoming Vulnerability for Competitive Advantage , 2005 .

[16]  R. D. Buzzell,et al.  Channel Partnerships Streamline Distribution , 1995 .

[17]  Martin W. P. Savelsbergh,et al.  The Stochastic Inventory Routing Problem with Direct Deliveries , 2002, Transp. Sci..