基于改进弗洛伊德算法的救护车应急救援路径规划

Ambulance Emergency Rescue Path Planning Based on Improved Freudian Algorithm

频频发生的突发事故以及日益严峻的城市交通拥挤堵塞等,都给应急救援工作带来了巨大挑战。在应急救援中,传统的救护车调度方法过于单一,导致救援效率偏低,对此,提升和优化急救车的调度算法势在必行。通过ArcMap以交通道路为源构建了网络数据集,将交通道路网抽象为图结构,对传统的弗洛伊德算法进行了改进。该算法综合考虑了道路拥挤情况、救援物资储备、患者和医院的地理位置、车辆空闲情况等多维因素,实现了基于改进弗洛伊德算法的救护车应急救援路径规划。仿真结果表明,改进弗洛伊德算法较传统的算法节省了近20%的时间,提高了应急救护车的调度效率。

With the increasingly severe urban traffic congestion, the frequency of sudden man-made accidents increases, which brings great challenges to the emergency rescue work. The traditional ambulance dispatching method is too single, so it is imperative to improve and optimize the dispatching algorithm of ambulance. In this paper, a network data set based on traffic roads is constructed by ArcMap, which abstracts the traffic road network into a graph structure and improves the traditional Freudian algorithm. The algorithm comprehensively considered the multi-dimensional factors such as road congestion, rescue material reserve, geographical location of patients and hospitals, and vehicle idle situation, and realized the ambulance emergency rescue path planning based on the improved Freudian algorithm. The simulation results show that the improved Freudian algorithm saves nearly 20% of the time compared with the traditional algorithm, and greatly improves the scheduling efficiency of emergency ambulance.