Automated terminal horizontal transportation scheduling and route planning under network resource allocation
In order to improve the efficiency of horizontal transportation of automated container terminals and reduce conflicts between automated guided vehicles(AGV)in the horizontal transportation,a multi-AGV horizontal transportation scheduling and path planning model with the goal of minimizing makespan is established,a dynamic allocation strategy of road network resources is proposed,and a two-layer algorithm composed of Cultural-Genetic Algorithm and Dijkstra Algorithm based on time window is designed to solve the model.The upper layer algorithm is the Cultural-Genetic Algorithm to optimize the scheduling of AGV,and the lower algorithm is the Dijkstra Algorithm based on time window for conflict-free route planning,which effectively reduces the makespan of horizontal transportation at the automated terminal and reduces the possibility of conflict.By comparing the dynamic allocation policy control method,speed control method and task priority control method based on road network resources,the effectiveness of the proposed method in solving the problem of horizontal transportation scheduling and path planning of automated container terminals is verified.
automated container terminalhorizontal transportation schedulingpath planningcultural-genetic algorithmdijkstra algorithm based on time window
万方数据
维普
