Dynamic Scheduling Optimization of Automatic Guide Vehicle for Terminal Delivery under Uncertain Conditions

As an important part of urban terminal delivery, automated guided vehicles (AGVs) have been widely used in the field of takeout delivery. Due to the real-time generation of takeout orders, the delivery system is required to be extremely dynamic, so the AGV needs to be dynamically scheduled. At the same time, the uncertainty in the delivery process (such as the meal preparation time) further increases the complexity and difficulty of AGV scheduling. Considering the influence of these two factors, the method of embedding a stochastic programming model into a rolling mechanism is adopted to optimize the AGV delivery routing. Specifically, to handle real-time orders under dynamic demand, an optimization mechanism based on a rolling scheduling framework is proposed, which allows the AGV’s route to be continuously updated. Unlike most VRP models, an open chain structure is used to describe the dynamic delivery path of AGVs. In order to deal with the impact of uncertain meal preparation time on route planning, a stochastic programming model is formulated with the purpose of minimizing the expected order timeout rate and the total customer waiting time. In addition, an effective path merging strategy and after-effects strategy are also considered in the model. In order to solve the proposed mathematical programming model, a multi-objective optimization algorithm based on a NSGA-III framework is developed. Finally, a series of experimental results demonstrate the effectiveness and superiority of the proposed model and algorithm.