基于边缘计算的车辆调度模型

Vehicle Scheduling Model Based on Edge Computing

文中通过寻找边缘节点部署的最佳方案,以协助大型露天矿山在复杂车辆运输、开采环节中的车辆调度。首先,对初始状态下的车辆运输模型进行分析,寻找车辆运输的规律和特点,通过动态规划算法寻找最优边缘部署节点,再通过路径最优、调度最佳、传输最快等准则完成车辆调度节点的部署,在满足边缘节点信息传输的最大传输数量的同时,使车辆边缘节点优化率达到最大。最后,通过仿真与实验证明,上述算法可有效地解决矿山车辆调度时延问题,提高信息的实时传输效率。

In this paper,the best solution for deploying edge nodes is sought to assist in the vehicle scheduling of large open-pit mines in complex vehicle transportation and mining processes.First,the vehicle transportation model in the initial state is analyzed to find the laws and characteristics of vehicle transportation,and the optimal edge deployment node is found through the dynamic programming algorithm.Then the vehicle scheduling node is deployed through the criteria of optimal path,optimal scheduling,and fastest transmission.While meeting the maximum number of information transmission of edge nodes,the optimization rate of vehicle edge nodes is maximized.Finally,through simulation and experiments,it is proved that the above algorithm can effectively solve the problem of vehicle scheduling delay in mines and improve the real-time transmission efficiency of information.