TY - GEN
T1 - Integrating order assignment and rack assignment in robotic mobile fulfillment system
AU - Shi, Xiang
AU - Zhou, Xuan
AU - Fan, Yunfeng
AU - Zhang, Le Le
AU - Deng, Fang
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - In this paper, a three-phase hybrid heuristic algorithm based on product supply relationship (TP-HHA) is proposed to deal with the problem of order and rack assignment for picking stations (ORAPS). The ORAPS occurs in the order picking process of robotic mobile fulfillment system (RMFS). It is an NP-hard problem so that the optimal algorithm is difficult to effectively solve it with larger scale instances, which cannot meet the requirements of real applications. To overcome this difficulty, we propose the TP-HHA. It firstly uses a problem decomposition frame to divide the ORAPS into three subproblems. Then, in each stage, a meta-heuristic or constructive heuristic is designed to solve the corresponding subproblem. In addition, a post-optimization strategy is employed to find a better solution. The sufficient neighborhood search operators with problem-specific knowledge are designed for both subproblem optimization and post-optimization. The computational results are given to verify the effectiveness of our algorithm.
AB - In this paper, a three-phase hybrid heuristic algorithm based on product supply relationship (TP-HHA) is proposed to deal with the problem of order and rack assignment for picking stations (ORAPS). The ORAPS occurs in the order picking process of robotic mobile fulfillment system (RMFS). It is an NP-hard problem so that the optimal algorithm is difficult to effectively solve it with larger scale instances, which cannot meet the requirements of real applications. To overcome this difficulty, we propose the TP-HHA. It firstly uses a problem decomposition frame to divide the ORAPS into three subproblems. Then, in each stage, a meta-heuristic or constructive heuristic is designed to solve the corresponding subproblem. In addition, a post-optimization strategy is employed to find a better solution. The sufficient neighborhood search operators with problem-specific knowledge are designed for both subproblem optimization and post-optimization. The computational results are given to verify the effectiveness of our algorithm.
UR - http://www.scopus.com/inward/record.url?scp=85135794669&partnerID=8YFLogxK
U2 - 10.1109/ICCA54724.2022.9831844
DO - 10.1109/ICCA54724.2022.9831844
M3 - Conference contribution
AN - SCOPUS:85135794669
T3 - IEEE International Conference on Control and Automation, ICCA
SP - 611
EP - 617
BT - 2022 IEEE 17th International Conference on Control and Automation, ICCA 2022
PB - IEEE Computer Society
T2 - 17th IEEE International Conference on Control and Automation, ICCA 2022
Y2 - 27 June 2022 through 30 June 2022
ER -