.png){kind=icon}
.png){kind=icon}
Return
A Two-Stage Hybrid Heuristic Algorithm for Simultaneous Order and Rack Assignment Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TASE.2021.3100718.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The problem of order and rack assignment to picking stations (ORAPS) is a key joint optimization problem in the order picking process of the robotic mobile fulfillment system (RMFS). Given a set of customer orders and a set of mobile racks, the goal of this problem is to simultaneously assign orders and racks to multiple picking stations so that the racks can provide products to meet the demand of orders by the minimal number of visits to all picking stations. In this article, we build a mathematical model for the ORAPS, which considers all orders assignment with the allocable capacity interval of the picking station and the rack product capacity limitation. To solve the ORAPS problem, we propose a two-stage hybrid heuristic algorithm (TS-HHA) consisting of the reducing stage and the assigning stage. In the reducing stage, a scheme of dynamic programming (DP) is introduced to find a critical rack set, which can focus attention on the most promising racks and increase the speed of problem-solving. In the assigning stage, we propose an optimization strategy that combines a constructive heuristic algorithm and adaptive neighborhood search (CH-ANS). It can generate a high-quality simultaneous assignment scheme and further improve its quality effectively. The computational results show that our proposed algorithm performs better than its competitors on both simulation and practical instances of the ORAPS problem.
Keywords:
Heuristic algorithms
Mathematical model
Optimization
Warehousing
Technological innovation
Supply chains
Search problems
Adaptive neighborhood search (ANS)
integrated operational optimization
order picking
robotic mobile fulfillment system (RMFS)
simultaneous assignment
Journal
IF:
6.4
Papers:
4.9K
Citations:
1.6W