2020
DOI: 10.1016/j.ssci.2020.104836
|View full text |Cite
|
Sign up to set email alerts
|

Finding the earliest arrival path through a time-varying network for evacuation planning of mine water inrush

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 13 publications
(11 citation statements)
references
References 26 publications
0
11
0
Order By: Relevance
“…These four methods can solves main problem of capacity‐based path planning in the view of macroscopic planning. In addition, since edge weight can varied over time, Wu et al 7,8 propose a time‐varying shortest path algorithm to find the earliest arrival path and its parallel version for searching the shortest route through a network with edge weight variation over time with a better computation efficiency.On the other hand for the perspective of microscopic planning, agent‐based methods are adopted to simulate crowd behavior. Pan et al 9 present an agent‐based framework to simulate human and social behaviors during emergency evacuations.…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations
“…These four methods can solves main problem of capacity‐based path planning in the view of macroscopic planning. In addition, since edge weight can varied over time, Wu et al 7,8 propose a time‐varying shortest path algorithm to find the earliest arrival path and its parallel version for searching the shortest route through a network with edge weight variation over time with a better computation efficiency.On the other hand for the perspective of microscopic planning, agent‐based methods are adopted to simulate crowd behavior. Pan et al 9 present an agent‐based framework to simulate human and social behaviors during emergency evacuations.…”
Section: Related Workmentioning
confidence: 99%
“…To this end, different factors, including the topology of the roadway network, which is pre‐stored in the basic information module, spatIOTemporal water spreading process data of water height at each vertex Hit can be simulated to predict the evolution of the water inrush catastrophe. Moreover, it is assumed that the transit velocity Sijt follows an empirical function for water height Hit and Hjt 7 . In this case, the transit time Cijt=Lengthij/Sijt varies over time and the time‐varying network is constructed.…”
Section: The Cloud Ee‐mwi Architecturementioning
confidence: 99%
See 2 more Smart Citations
“…The rescue of coal mine water inrush accident is difficult, and it takes a long time for the mine to resume normal production, which often causes huge economic losses and casualties [1][2][3]. With the increasing of mining depth and intensity, the hydrogeological conditions of coalfield are becoming more and more complex, and the threat of floor confined water to mine safety production is increasingly serious [4][5][6].…”
Section: Introductionmentioning
confidence: 99%