The Benefits of Re-Evaluating the Real-Time Fulfillment Decisions

At the time of a customer order, the e-tailer assigns the order to one or more of its order fulfillment centers, and/or to drop shippers, so as to minimize procurement and transportation costs, based on the available current information. However this assignment is necessarily myopic as it cannot account for all future events, such as subsequent customer orders or invento ry replenishments. We examine the potential benefits from periodically re-evaluating these real-time order-assignment decisions. We construct near-optimal heuristics for the re-assignment fora large set of customer orders with the objective to minimize the total number of shipments. We investigate how best to implement these heuristics for a rolling horizon, and discuss the effect of demand correlation, customer order size, and the number of customer orders on the nature of the heuristics. Finally, we present potential saving opportunities by testing the heuristics on sets of order data from a major e-tailer.

[1]  J. Billheimer,et al.  Network Design with Fixed and Variable Cost Elements , 1973 .

[2]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[3]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[4]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[5]  Thomas L. Magnanti,et al.  A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design , 1989, Oper. Res..

[6]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[7]  S. Raghavan,et al.  Formulations and algorithms for network design problems with connectivity requirements , 1995 .

[8]  Ping Josephine Xu,et al.  Order fulfillment in online retailing : what goes where , 2005 .

[9]  David J. Goodman,et al.  Personal Communications , 1994, Mobile Communications.

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[12]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[13]  Richard T. Wong,et al.  A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..

[14]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[15]  Dushyant Sharma,et al.  New neighborhood search structures for the capacitated minimum spanning tree problem , 1998 .

[16]  Maria Grazia Scutellà,et al.  A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems , 2004, J. Comb. Optim..

[17]  Kalyan T. Talluri Swapping Applications in a Daily Airline Fleet Assignment , 1996, Transp. Sci..

[18]  A. Rapoport,et al.  Connectivity of random nets , 1951 .