Order Batching With Time Constraints in a Parallel-aisle Warehouse: a Multiple-policy Approach

A commitment of delivery time is critical in some online businesses (De Koster, 2003). An important challenge to meeting customers’ needs is timely order picking which is also relevant to worker safety, item freshness, overall operational synchronization, and reduced overtime. We analyze an order batch picking situation where a trip is constrained by vehicle capacity and must be completed within a specified time. We develop a model which partitions orders to batches to minimize the total travel time such that each trip meets the orders’ time constraints and capacity limit, and also determines a suitable operational policy for each batch. Each policy is characterized by routing method, travel speed, capacity, and pick time. The proposed batching model can simultaneously group orders and can select a best policy among possible policy choices

[1]  Marc Goetschalckx,et al.  Research on warehouse operation: A comprehensive review , 2007, Eur. J. Oper. Res..

[2]  Edward H. Frazelle,et al.  World-Class Warehousing and Material Handling , 2001 .

[3]  H. D. Ratliff,et al.  Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem , 1983, Oper. Res..

[4]  R. Meller,et al.  Multi-shuttle automated storage/retrieval systems , 1997 .

[5]  S. Seemüller Durchsatzberechnung automatischer Kleinteilelager im Umfeld des elektronischen Handels , 2005 .

[6]  Yavuz A. Bozer,et al.  Travel-Time Models for Automated Storage/Retrieval Systems , 1984 .

[7]  NOUD GADEMANN,et al.  Order batching to minimize total travel time in a parallel-aisle warehouse , 2005 .

[8]  René M. B. M. de Koster,et al.  Distribution strategies for online retailers , 2003, IEEE Trans. Engineering Management.

[9]  Chih-Ming Hsu,et al.  Batching orders in warehouses by minimizing travel distance with genetic algorithms , 2005, Comput. Ind..

[10]  Brett A. Peters,et al.  Batch picking in narrow-aisle order picking systems with consideration for picker blocking , 2012, Eur. J. Oper. Res..

[11]  Tho Le-Duc,et al.  Design and Control of Efficient Order Picking Processes , 2005 .

[12]  M. B. M. de Koster,et al.  Efficient orderbatching methods in warehouses , 1999 .

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

[14]  Wei Huang,et al.  Travel time analysis for the double-deep dual-shuttle AS/RS , 2015 .

[15]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[16]  Mark S. Daskin,et al.  Location-Routing Problems with Distance Constraints , 2007, Transp. Sci..

[17]  Yeming Gong,et al.  A polling-based dynamic order picking system for online retailers , 2008 .

[18]  B. Gnedenko,et al.  Lehrbüch der Wahrscheinlichkeitsrechnung , 1978 .