启发式
计算机科学
数学优化
比例(比率)
集合(抽象数据类型)
质量(理念)
订单(交换)
最优化问题
分配问题
运筹学
算法
数学
哲学
物理
认识论
财务
量子力学
经济
程序设计语言
作者
Xiang Shi,Fang Deng,Miao Guo,Jiachen Zhao,Lin Ma,Bin Xin,Jie Chen
出处
期刊:IEEE transactions on systems, man, and cybernetics
[Institute of Electrical and Electronics Engineers]
日期:2023-11-08
卷期号:54 (2): 1226-1238
被引量:1
标识
DOI:10.1109/tsmc.2023.3326554
摘要
The emergence of a robotic mobile fulfillment system (RMFS) provides an automated solution for e-commerce warehousing to improve productivity and reduce labor costs. This article studies the order picking optimization problem in RMFS, which simultaneously decides the assignment of orders and racks to multiple picking stations. Although this problem has been widely studied in recent years, it is still very challenging for existing methods to solve large-scale instances effectively (e.g., more than 200 orders and 500 racks). To overcome this difficulty to meet the real-world needs, we propose a fulfillment-focused simultaneous assignment (FFSA) method. The proposed FFSA comprises two stages: 1) compression and 2) simultaneous assignment. The compression stage employs a hybrid adaptive large neighborhood search (ALNS) strategy to establish a reduced set of critical racks that can fulfill the demand of all orders. In the simultaneous assignment stage, we develop a marginal-return-based assignment with candidate strategy (MRACS) to simultaneously assign orders and critical racks to picking stations. MRACS takes into account three fulfillment-focused measurements to depict the product supply relationship between the demand of orders and the inventory on critical racks. These measurements are further integrated into the effective heuristics with sufficient problem-specific knowledge to obtain a high-quality solution. Experimental results show that our method significantly outperforms representative algorithms on both synthetic data and large-scale real-world data.
科研通智能强力驱动
Strongly Powered by AbleSci AI