Item storage reassignment problem in robotic mobile fulfillment systems under customer order characteristic fluctuations
Xinru Wu
What the paper says
This article studies the item storage reassignment problem (ISRP) in the robotic mobile fulfilment system (RMFS). As the demand pattern evolves, the item storage assignment should be adapted accordingly to avoid potential workload. Hence, the item storage reassignment becomes an indispensable process of warehouse operations. This paper proposes an Interchange-Guided Sequencing Algorithm (IGSA) that identifies the interchange dependencies between item groups and constructs the corresponding group interchange sequence. Computational experiments demonstrate the effectiveness of the proposed algorithm and further analyse when reassignment should be performed under different item varieties and warehouse capacities.
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.50 × 0.4 = 0.20 |
| M · momentum | 0.50 × 0.15 = 0.07 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.