Optimized Earthquake Evacuation Routes Using Dijkstra's Algorithm and WinQSB

Abstract

This research analyzes and generates optimal evacuation routes in the Barranco district during earthquake scenarios using the Dijkstra algorithm implemented through WinQSB. A preliminary review was conducted to establish key concepts related to earthquake dynamics, evacuation route planning, and the application of Dijkstra’s algorithm. Given its high seismic exposure and the prevalence of aging infrastructure, Barranco is considered highly vulnerable to earthquake impacts. Based on this context, a detailed graph-based model of the district’s road network and designated assembly points was constructed and processed using WinQSB to determine the most efficient evacuation paths. Variables such as distance and estimated walking time were incorporated into the analysis. The application of Dijkstra’s algorithm produced minimum-route solutions, reducing evacuation distances by approximately 30% and yielding estimated evacuation times between 2.36 and 9.24 minutes across the district’s different zones. Route calculations were completed in under one second per node pair, demonstrating the method’s appropriateness for small to medium-sized urban areas. The study concludes that generating optimized evacuation routes through Dijkstra’s algorithm and WinQSB represents an effective strategy for improving earthquake response planning in Barranco. Additionally, the approach can be adapted to other urban contexts by tailoring the graph model to local conditions, though scalability enhancements would be required for application in larger metropolitan areas.