Optimal Evacuation Route Analysis in Underground Stations Using Various Algorithms

View at Publisher

Ask AI

Bookmark

Share

Key Points

This research aims to identify and compare optimal evacuation routes during disasters in underground stations using various algorithms.
Analyzed evacuation routes using Dijkstra, A, and Greedy algorithms in a simulated underground three-level station.
Considered factors like crowding and reduced movement speed due to disasters.
Compared maximum evacuation times reported by each algorithm.
A algorithm achieved the best evacuation time of 349 seconds, while Dijkstra took 365 seconds, and Greedy took 1,545 seconds.
Dijkstra's theoretically optimal choice led to delays due to increased crowding on similar paths.
The A algorithm's heuristic approach resulted in a more diverse path selection, reducing crowding.

Evaluates evacuation routes in underground stations, suggesting algorithm choice impacts efficiency.

No abstract yet. The journal hasn't published one we can show.

No takes yet. Share an insight, caveat, or question.

강치영 et al. (2026) studied this question.

View at Publisher

Ask AI

Bookmark

Share