OPTIMAL ROUTING ALGORITHMS FOR EMERGENCY RESPONSE SERVICES

Abstract

The purpose of this study is to enhance the efficiency of emergency response services by optimizing routing algorithms and developing a mathematical model and algorithms that ensure the shortest paths while accounting for real-time changes in road conditions.Methodology. The study employs methods of graph theory, heuristic and adaptive algorithms, as well as simulation modeling to compare the effectiveness of various approaches.Scientific novelty. A comprehensive approach to route planning is proposed for the first time, taking into account dynamic changes in traffic conditions in real time. It is based on an adaptive algorithm with a replanning mechanism. Unlike classical methods, the developed algorithm allows for timely route adjustments in case of traffic jams, accidents, or road closures, ensuring solution robustness and minimizing arrival time. Moreover, the study considers the scalability of the algorithms for various types of settlements – from large metropolitan areas to rural regions – while accounting for specific features of the transportation infrastructure. An important aspect of the novelty lies in the integration of the model into real-world decision support systems, enabling not only simulation but also practical implementation of the results.Conclusions. The proposed adaptive routing approach significantly reduces the average response time of emergency services, as confirmed by simulation results. The developed algorithms provide flexible handling of real-time traffic dynamics and can be integrated into modern dispatch systems. The solution’s scalability and technological compatibility make it promising for implementation in various administrative and territorial contexts of Ukraine.