Emergency Vehicle Route Planning Considering Demand Urgency Research

In urban emergency management, it is crucial to plan paths for emergency vehicles quickly and accurately, especially in cases of traffic congestion and road damage due to extreme weather such as heavy rainfall. Traditional path planning algorithms often ignore the urgency of different demands, resulting in delayed emergency response time. To solve this problem, this study proposes an emergency vehicle path planning method based on Dijkstra's algorithm that considers the urgency of demands. When performing emergency rescue in heavy rainfall conditions, in conjunction with the Dijkstra algorithm, this paper considers some improvements to improve rescue effectiveness and response time. Road capacity, real-time data integration, multi-team collaboration and Dijkstra's algorithm are combined. With these improvements, the Dijkstra algorithm can be made more efficient and flexible to optimize the path, reduce the rescue time, and improve the efficiency in the emergency rescue problem under heavy rainfall condition.