2016
DOI: 10.1109/tvt.2015.2409135
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: Numerous approaches have been proposed to solve shortest-path query problems 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 cos… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 27 publications
0
3
0
Order By: Relevance
“…Table 1 by taking m=n/2 as mentioned before. As this paper is working on the future scope of the ONSC [6] procedure so it has all the advantage of the existing system. This approach takes less than 3 to 4 ms to compute the nearest shelter and its shortest path which is faster than other existing approaches.…”
Section: B Resultsmentioning
confidence: 99%
“…Table 1 by taking m=n/2 as mentioned before. As this paper is working on the future scope of the ONSC [6] procedure so it has all the advantage of the existing system. This approach takes less than 3 to 4 ms to compute the nearest shelter and its shortest path which is faster than other existing approaches.…”
Section: B Resultsmentioning
confidence: 99%
“…However, the scheme is limited to indoor environments. P. Tsai et al [8] presents a dynamic event-dependent network model. Rapid calculation and storage of the path becomes an important link in any emergency situation.…”
Section: Related Workmentioning
confidence: 99%
“…Song et al [1], [2] proposed an evacuation probability reasoning model based on the Markov decision process, B. Tang et al [3] presents a Robot-Assisted evacuation scheme and E. Boukas et al [4] presents an accurate Cellular Automaton simulation mod-el, V.S. Kalogeiton et al [5] presented a dynamic model based on bionics, M. Di Gangi [6] proposed a dy-D namic distributed evacuation model, L. Chen et al [7] presented a distributed emergency evacuation guidance framework based on wireless sensor networks, P. Tsai et al [8] proposed a dynamic event-related network model, and S. Mukherjee et al [9] presented a population dynamic model based on the Lagrangian method. Many representative emergency evacuation planning systems have been designed and built at the same time.…”
Section: Introductionmentioning
confidence: 99%