Robot-storage zone assignment strategies in mobile fulfillment systems. (February 2019)

• Record Type: Journal Article
• Authors: Roy, Debjit; Nigam, Shobhit; de Koster, René; Adan, Ivo; Resing, Jacques
• Is Part Of: Transportation research. Volume 122(2019)
• Page Start: 119
• Page End: 142
• Publication Date: 2019-02
• Subjects: Mobile shelves -- Robot assignment -- Queueing models -- Design insights; Logistics -- Periodicals; Transportation -- Periodicals; 388.011
• DOI: 10.1016/j.tre.2018.11.005
• Languages: English
• ISSNs: 1366-5545

Abstract

Highlights: Estimate throughput of MFS with both picking and replenishment. Analyze tradeoffs between dedicated and pooled robot assignment. Analyze tradeoffs between random vs. shortest queue allocation of robots. Abstract: The robotic mobile fulfillment system (MFS) is widely used for automating storage pick and pack activities in e-commerce distribution centers. In this system, the items are stored on movable storage shelves, also known as inventory pods, and brought to the order pick stations by robotic drive units. We develop stylized performance evaluation models to analyze both order picking and replenishment processes in a mobile fulfillment system storage zone, based on multi-class closed queueing network models. To analyze robot assignment strategies for multiple storage zones, we develop a two-stage stochastic model. For a single storage zone, we compare dedicated and pooled robot systems for pod retrieval and replenishment. For multiple storage zones, we also analyze the effect of assigning robots to least congested zones on system throughput in comparison to random zone assignment. The models are validated using detailed simulations. For single zones, the expected throughput time for order picking reduces to one-third of its initial value by using pooled robots instead of dedicated robots; however, the expected replenishment time estimate increases up to three times. For multiple zones, we find that robots that are assigned to storage zones with dedicated and shortest queues provide a greater throughput than robots assigned at random to the zones.