Name
Abstract | ||
|---|---|---|
•We define a real-time emergency evacuation problem that seeks for rapid evacuation routes in buildings.•We formulate the stochastic routing problem as a non-linear routing problem subject to node-wise constraints.•We prove the problem to be NP-hard.•We suggest the exact dynamic programming algorithm and two polynomial time approximation algorithms.•We present and discuss a case study and results of computational experiments. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.cie.2014.08.003 | Computers & Industrial Engineering |
Keywords | Field | DocType |
Real-time emergency routing,No-notice building evacuation,Dynamic programming,Fully polynomial-time approximation scheme,Fully polynomial-time approximately feasible scheme | Approximation algorithm,Dynamic programming,Mathematical optimization,Random variable,Emergency evacuation,Computer science,Geometric networks,Time complexity,Polynomial-time approximation scheme,Computation | Journal |
Volume | Issue | ISSN |
76 | C | 0360-8352 |
Citations | PageRank | References |
1 | 0.36 | 24 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huajun Tang | 1 | 5 | 1.44 |
| Amir Elalouf | 2 | 22 | 5.99 |
| Eugene Levner | 3 | 466 | 48.53 |
| T.C.E. Cheng | 4 | 628 | 50.67 |