期刊
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
卷 167, 期 -, 页码 -出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2022.102920
关键词
e-commerce warehousing; Robotic mobile fulfillment systems; Rack storage assignment; Robot-rack assignment
类别
资金
- key projects of the National Natural Science Foundation of China [71931009, 72010107002]
This paper investigates the rack storage and robot assignment problem in robotic mobile fulfillment systems with the goal of minimizing the makespan. A matheuristic decomposition approach is proposed and tested, demonstrating good performance for both large-scale real-world cases and small-scale synthetic instances.
Robotic mobile fulfillment systems provide a new solution for e-commerce retailers to fulfill customers' orders, wherein racks are moved by mobile robots to workstations so pickers can retrieve the purchased products. While such automated parts-to-picker systems can save on labor costs, they raise new operational challenges. In this paper, we investigate the rack storage and robot assignment to racks problem during order processing. We formulate this problem with the goal of minimizing the makespan of the system. Based on a rolling horizon framework and the simulated annealing method, we develop a matheuristic decomposition approach, which involves the solution of a special axial 3-index assignment problem in each stage to solve the problem. We test the performance of the proposed method for both large-scale cases based on a real-world dataset and small-scale instances generated synthetically. Computational results demonstrate the good performance of the proposed approach.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据