Order batch picking optimization under different storage scenarios for e-commerce warehouses

Abstract To improve the operational efficiency of e-commerce warehouses, multi-location storage systems which means each stock keeping unit can be stored in multiple locations or a location can contain multiple stock keeping units, have been developed and applied in practice. When orders are picked in a batch, how to select the picking location from storage locations holding the identical stock keeping unit obviously affects how far the pickers must travel to complete the picking tasks. However, few works have systematically studied how to optimize order batch picking from the perspective of different storage systems. This paper formulated the order batch picking optimization problems for three typical storage systems and developed the algorithm package including location interval distance algorithm, location selection algorithm, routing algorithm and order batching algorithm to tackle them. Our work is particularly capable to covering the situation of multi-location storage system. The numerical experiment results show that the performance of the proposed algorithm combinations is satisfactory to solve the problems with different size both in solution quality and computation efficiency. The applicable algorithm combinations used in practice are also recommended by comparative analysis. Our study can provide valuable decision reference to warehouse managers for operating batch picking system especially under multi-location scenarios efficiently.

[1]  Hadrien Cambazard,et al.  Exact algorithms for the order picking problem , 2017, Comput. Oper. Res..

[2]  Kris Braekers,et al.  Increasing order picking efficiency by integrating storage, batching, zone picking, and routing policy decisions , 2017 .

[3]  Nils Boysen,et al.  Scattered Storage: How to Distribute Stock Keeping Units All Around a Mixed-Shelves Warehouse , 2018, Transp. Sci..

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

[5]  Sunderesh S. Heragu,et al.  Order oriented slotting: a new assignment strategy for warehouses , 2007 .

[6]  Cansu Kandemir,et al.  A Pseudo-Polynomial Time Algorithm for a Special Multiobjective Order Picking Problem , 2015, Int. J. Inf. Technol. Decis. Mak..

[7]  Temel Öncan,et al.  An exact solution approach for the order batching problem , 2015 .

[8]  Osman Kulak,et al.  Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms , 2012 .

[9]  Kees Jan Roodbergen,et al.  Design and control of warehouse order picking: A literature review , 2006, Eur. J. Oper. Res..

[10]  Haldun Süral,et al.  Order picking in parallel-aisle warehouses with multiple blocks: complexity and a graph theory-based heuristic , 2019 .

[11]  Li Zheng,et al.  A correlated storage location assignment problem in a single-block-multi-aisles warehouse considering BOM information , 2010 .

[12]  James S. Noble,et al.  A two-phased heuristic for relation-based item location , 2015, Comput. Ind. Eng..

[13]  Felix Weidinger,et al.  Picker routing in rectangular mixed shelves warehouses , 2018, Comput. Oper. Res..

[14]  Jianbin Li,et al.  Joint optimisation of order batching and picker routing in the online retailer’s warehouse in China , 2017, Int. J. Prod. Res..

[15]  Gangyan Xu,et al.  Heuristic routing methods in multiple-block warehouses with ultra-narrow aisles and access restriction , 2019, Int. J. Prod. Res..

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

[17]  Yin-Yann Chen,et al.  Using a hybrid approach based on the particle swarm optimization and ant colony optimization to solve a joint order batching and picker routing problem , 2015 .

[18]  Abraham Duarte,et al.  General Variable Neighborhood Search for the Order Batching and Sequencing Problem , 2017, Eur. J. Oper. Res..

[19]  Haldun Süral,et al.  Order picking in a parallel-aisle warehouse with turn penalties , 2016 .

[20]  Gerhard Wäscher,et al.  Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing , 2017, Central Eur. J. Oper. Res..

[21]  Marcelo Seido Nagano,et al.  An approach for the solution to order batching and sequencing in picking systems , 2019, Production Engineering.

[22]  Abraham Duarte,et al.  Variable Neighborhood Search strategies for the Order Batching Problem , 2017, Comput. Oper. Res..

[23]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[24]  Arjan S. Dijkstra,et al.  Order picker routing with product returns and interaction delays , 2017, Int. J. Prod. Res..

[25]  Kees Jan Roodbergen,et al.  Routing methods for warehouses with multiple cross aisles , 2001 .

[26]  Birger Raa,et al.  Using a TSP heuristic for routing order pickers in warehouses , 2010, Eur. J. Oper. Res..

[27]  Nils Boysen,et al.  Picker routing in the mixed-shelves warehouses of e-commerce retailers , 2019, Eur. J. Oper. Res..

[28]  Gerhard Wäscher,et al.  Tabu search heuristics for the order batching problem in manual order picking systems , 2012, Eur. J. Oper. Res..

[29]  Ivan Zulj,et al.  A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem , 2018, Eur. J. Oper. Res..

[30]  M. B. M. de Koster,et al.  Routing orderpickers in a warehouse: a comparison between optimal and heuristic solutions , 1998 .