Routing strategies in large-scale automatic storage and retrieval systems

摘要

We consider the route planning problems in large-scale automatic storage and retrieval systems (AS/RS), with arnfocus on the interaction of shipments. First, we propose a strategic flow model to spread out the flow of shipmentsrnover the K shortest paths in the long term. Secondly, based on the dynamic stochastic shortest path model, werndevelop an adaptive routing strategy with advantages in facilitating dynamic routing fashion with real-timerninformation. Numerical experiments show that the two proposed routing strategies achieve 12.8% and 28.8%rnimprovement on travel time respectively.