EvacuWise: Optimization Of Indoor Earthquake Egress Routes In San Miguel National High School Using Dijkstra’s Algorithm

Abstract

This study developed EvacuWise, a static indoor earthquake egress-routing framework for San Miguel National High School using Dijkstra’s Algorithm and measured building-pathway data. Forty-three physical buildings and facilities were represented through 42 weighted undirected graph models because Buildings 1 and 2 were treated as one connected model. Across these graphs, 935 vertices and 930 measured edges represented doors, corners, stairways, and designated exits. A Python implementation of Dijkstra’s Algorithm computed the minimum-distance route from every door to the nearest reachable exit. The analysis generated 411 door-to-exit routes with distances ranging from 0.30 m to 69.85 m, with a mean (M) of 20.29 m and a standard deviation (SD) of 16.76 m. The longest route occurred from Door 65 of Building #10, Department of Education (DepEd) Standard School Building 4 (Laboratory), at 69.85 m. Model-derived travel-time estimates ranged from 0.23 s to 70.00 s using route-segment speed parameters embedded in the computational script; 233 routes (56.7%) included at least one stair segment. Route maps were generated to visualize the computed paths and their destination exits. The findings show that graph-based shortest-path analysis can convert measured school layouts into reproducible static egress plans and can identify buildings with longer or more complex indoor travel paths. The resulting maps are intended for preparedness planning and future supervised drills may help examine the effects of capacity, congestion, and bottlenecks on the computed routes.