Name
Abstract | ||
|---|---|---|
This paper presents an innovative method to facilitate making such a plan.Using an algorithm to schedule the starting time of each evacuation group,the method guarantees that the time of completing a large-scale evacuation is very close to its theoretically shortest evacuation time. Meanwhile,unlike a simultaneous evacuation,during a staged evacuation planned with the proposed method,all evacuees can take the shortest path to a safe exit.Once evacuees start off,they will not suffer any traffic congestion.The above advantages of this innovative method are achieved by using an algorithm with three nested loops.Experiments have been conducted,and their results have validated the proposed method. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s11424-012-0257-4 | J. Systems Science & Complexity |
Keywords | Field | DocType |
Algorithm,disaster,staged evacuation,starting time | Mathematical optimization,Shortest path problem,Simulation,Traffic congestion,Mathematics,Nested loop join | Journal |
Volume | Issue | ISSN |
25 | 06 | 1009-6124 |
Citations | PageRank | References |
1 | 0.45 | 5 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiang Li | 1 | 110 | 11.84 |
| B. Huang | 2 | 81 | 9.27 |
| Zhengjun Liu | 3 | 34 | 5.14 |
| Xihui Zhang | 4 | 45 | 6.94 |
| Jing Sun | 5 | 491 | 88.35 |