On-the-Fly Nearest-Shelter Computation in Event-Dependent Spatial Networks in Disasters.

Numerous approaches have been proposed to solve shortest path query problems (SPQPs) in either static or time-dependent spatial networks; however, these approaches are neither appropriately nor efficiently used to find the nearest shelter with fastest paths in disaster evacuations. In disasters, segments of a path computed and saved as the fastest might become impassable. The nearest shelter differs for people depending on their locations and can also change on the basis of an unpredictable and highly dynamic edge cost (e.g., maximum passable vehicle speed), which is influenced by disaster events. To solve this problem, this paper proposes a dynamic network model, which is called an event-dependent network, to represent a spatial network in a disaster. Effective approaches using multiple algorithms are proposed for on-the-fly computation of the nearest shelter and fastest paths in a disaster. A distributed system consisting of a server and multiple mobile clients using our approaches is presented for navigating the fastest paths for people to evacuate a disaster area. Real-world maps, such as a map of California, were used in our experiments. The results revealed that our approaches require less than 2 ms to find a new nearest shelter and its fastest paths, which is faster than other approaches for solving the fastest-path problem. [ABSTRACT FROM AUTHOR]