4.6 Article

Inventory allocation to robotic mobile-rack and picker-to-part warehouses at minimum order-splitting and replenishment costs

Journal

ANNALS OF OPERATIONS RESEARCH
Volume 316, Issue 1, Pages 467-491

Publisher

SPRINGER
DOI: 10.1007/s10479-021-04190-1

Keywords

Inventory allocation; Mobile-rack warehouse; Hybrid algorithm; Split order; Replenishment cost

Funding

  1. National Natural Science Foundation of China [71971036, 71931009, 71871035]
  2. Major Program of Key Disciplines in Dalian [2019J11CY002]
  3. Key R&D project of Liaoning Provincial Department of Science and Technology [2020JH2/10100042]
  4. MOE Layout Foundation of Humanities and Social Sciences [19YJA630084]

Ask authors/readers for more resources

This article discusses the advantages of a novel part-to-picker warehouse with robotic mobile racks in picking multi-item e-commerce orders, and the challenges faced by warehouse managers when the new warehouse coexists with an old one in a distribution center. It emphasizes the importance of SKU allocation in terms of cost efficiency and order fulfillment.
A novel part-to-picker warehouse with robotic mobile racks is spreading recently because of its advantages in picking multi-item e-commerce orders. However, warehouse managers may suffer the situation that the new warehouse and an old one coexist in a distribution center. Due to their respective capacities, any warehouse cannot hold all the stock keeping units (SKUs). How to allocate SKUs to the two warehouses is an important decision. It has a significant influence on the cost of combining the SKUs that have to be picked from two warehouses for customer orders. The problem is formulated by using an innovative virtual-warehouse-based idea, the NP-hardness of the problem is proved, and a hybrid algorithm by alternating between the large neighborhood search and local search is developed. Some effective data-driven strategies are proposed to improve the most time-consuming modules of the algorithm. Extensive case studies are conducted and good performances of the algorithm are shown when it is compared with the MIP solver on small-sized cases, and an adapted tabu search and a simulated annealing algorithm on large-sized real-world cases. The sensitivity analyses on key parameters of the problem are made and related managerial insights are obtained.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available