OPTIMAL SELECTION OF MOVABLE SHELVES UNDER CARGO-TO-PERSON PICKING MODE

In recent years, some e-commerce companies such as Amazon have adopted the cargo-to-person picking mode to improve their pickup efficiency. Under this mode, a shelf can store several types of goods and a type of goods can be placed on some shelves. When orders arrive, the warehouse robots move one shelf or more containing the ordered items to a fixed platform, and the pickers select the items from the shelves. It is very important to decide which shelves should be moved to increase picking efficiency. This paper addresses the problem of optimal movable-shelf selection for the cargoto-person picking mode. The goal of this study is to minimize the total time (costs) of moving the selected shelves to finish a batch of orders. We model this problem using 0-1 linear programming and show that the problem is NP-hard. Furthermore, we propose a three-stage hybrid heuristic algorithm with polynomial complexity to solve it. We conduct numerical experiments to show the efficiency of this algorithm. (Received, processed and accepted by the Chinese Representative Office.)

[1]  Ying Wang,et al.  A machine-learning approach to multi-robot coordination , 2008, Eng. Appl. Artif. Intell..

[2]  John Enright,et al.  Optimization and Coordinated Autonomy in Mobile Fulfillment Systems , 2011, Automated Action Planning for Autonomous Mobile Robots.

[3]  Raffaello D'Andrea,et al.  Alphabet Soup: A Testbed for Studying Resource Allocation in Multi-vehicle Systems , 2006 .

[4]  Ming-Hung Wu,et al.  Order batching in a pick-and-pass warehousing system with group genetic algorithm , 2015 .

[5]  Temel Öncan,et al.  MILP formulations and an Iterated Local Search Algorithm with Tabu Thresholding for the Order Batching Problem , 2015, Eur. J. Oper. Res..

[6]  Hoda Davarzani,et al.  Toward a relevant agenda for warehousing research: literature review and practitioners’ input , 2015, Logist. Res..

[7]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[8]  Quan Zhang,et al.  An algorithm for dynamic order-picking in warehouse operations , 2016, Eur. J. Oper. Res..

[9]  Youngjoo Kim,et al.  A route-selecting order batching model with the S-shape routes in a parallel-aisle order picking system , 2017, Eur. J. Oper. Res..

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

[11]  M. Yagiura,et al.  RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM , 2007 .

[12]  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 .

[13]  Dilip Kumar Pratihar,et al.  Task allocation and collision-free path planning of centralized multi-robots system for industrial plant inspection using heuristic methods , 2016, Robotics Auton. Syst..

[14]  Shuang Liu,et al.  A dynamic priority based path planning for cooperation of multiple mobile robots in formation forming , 2014 .

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

[16]  Yin-Yann Chen,et al.  An efficient hybrid algorithm for integrated order batching, sequencing and routing problem , 2015 .

[17]  Uwe Aickelin,et al.  A genetic algorithm approach for set covering problems , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[18]  Sebastian Henn,et al.  Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses , 2015 .

[19]  Raffaello D'Andrea,et al.  Coordinating Hundreds of Cooperative, Autonomous Vehicles in Warehouses , 2007, AI Mag..

[20]  Mincong Tang,et al.  Mass Customization in Flat Organization: The Mediating Role of Supply Chain Planning and Corporation Coordination , 2014 .

[21]  René M. B. M. de Koster,et al.  A review on stochastic models and analysis of warehouse operations , 2011, Logist. Res..

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

[23]  Alok Singh,et al.  A hybrid heuristic for the set covering problem , 2010, Operational Research.

[24]  Jiang,et al.  Task Assignment Problem of Robots in a Smart Warehouse Environment , 2016 .

[25]  J. Leung,et al.  A generalization of the weighted set covering problem , 2005 .

[26]  Zhenping Li,et al.  Mathematical Model and Algorithm for the Task Allocation Problem of Robots in the Smart Warehouse , 2015 .