Rack retrieval and repositioning optimization problem in robotic mobile fulfillment systems

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 n...

Full description

Saved in:
Bibliographic Details
Published in:Transportation research. Part E, Logistics and transportation review Vol. 167; p. 102920
Main Authors: Zhuang, Yanling, Zhou, Yun, Hassini, Elkafi, Yuan, Yufei, Hu, Xiangpei
Format: Journal Article
Language:English
Published: Elsevier Ltd 01-11-2022
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. •Integrates the rack retrieval and repositioning decisions in an RMFS environment.•Formulates a novel mathematical program to minimize the makespan of the system.•Develops a decomposition matheuristic wherein an axial 3-index assignment model is solved.•Our approach outperforms the current methods suggested in the literature.
ISSN:1366-5545
1878-5794
DOI:10.1016/j.tre.2022.102920