메뉴 건너뛰기




Volumn , Issue , 2011, Pages 597-604

Real-time pedestrian evacuation planning during emergency

Author keywords

Dynamic network flows; Evacuation planning; Heuristics

Indexed keywords

ALTERNATIVE APPROACH; DYNAMIC NETWORK FLOW; EVACUATION PLANNING; HEURISTIC APPROACH; HEURISTICS; LARGE NETWORKS; REAL TIME; SOLUTION TECHNIQUES;

EID: 84855813386     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2011.95     Document Type: Conference Paper
Times cited : (25)

References (9)
  • 1
    • 0001424107 scopus 로고
    • Constructing maximal dynamic flows from static flows
    • May-June
    • L. R. Ford and D. R. Fulkerson, "Constructing maximal dynamic flows from static flows," Operations Research, vol. 6, no. 3, pp. 419-433, May-June 1958.
    • (1958) Operations Research , vol.6 , Issue.3 , pp. 419-433
    • Ford, L.R.1    Fulkerson, D.R.2
  • 2
    • 6444234169 scopus 로고    scopus 로고
    • An annotated overview of dynamic network flows
    • 09
    • B. Kotnyek, "An annotated overview of dynamic network flows," INRIA, Tech. Rep. RR-4936, 09 2003.
    • (2003) INRIA, Tech. Rep. RR-4936
    • Kotnyek, B.1
  • 4
    • 26444598445 scopus 로고    scopus 로고
    • Capacity Constrained Routing algorithms for evacuation planning: A summary of results
    • Advances in Spatial and Temporal Databases: 9th International Symposium, SSTD 2005. Proceedings
    • Q. Lu, B. George, and S. Shekhar, "Capacity constrained routing algorithms for evacuation planning: A summary of results," in Advances in Spatial and Temporal Databases, ser. Lecture Notes in Computer Science, C. Bauzer Medeiros, M. Egenhofer, and E. Bertino, Eds. Springer Berlin/Heidelberg, 2005, vol. 3633, pp. 291-307. (Pubitemid 41433171)
    • (2005) Lecture Notes in Computer Science , vol.3633 , pp. 291-307
    • Lu, Q.1    George, B.2    Shekhar, S.3
  • 5
    • 85007217435 scopus 로고
    • The quickest transshipment problem
    • ser. SODA '95. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics
    • B. Hoppe and E. Tardos, "The quickest transshipment problem," in Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, ser. SODA '95. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 1995, pp. 512-521.
    • (1995) Proceedings of the Sixth Annual ACM-siam Symposium on Discrete Algorithms , pp. 512-521
    • Hoppe, B.1    Tardos, E.2
  • 6
    • 0034138344 scopus 로고    scopus 로고
    • The quickest transshipment problem
    • February [Online]
    • B. Hoppe and O. Tardos, "The quickest transshipment problem," Math. Oper. Res., vol. 25, pp. 36-62, February 2000. [Online]. Available: http://portal.acm.org/citation.cfm?id=351180.351185
    • (2000) Math. Oper. Res. , vol.25 , pp. 36-62
    • Hoppe, B.1    Tardos, O.2
  • 7
    • 84989675214 scopus 로고
    • On the use of lexicographic min cost flows in evacuation modeling
    • August
    • H. W. Hamacher and S. Tufekci, "On the use of lexicographic min cost flows in evacuation modeling," Naval Research Logistics, vol. 34, no. 4, pp. 487-503, August 1987.
    • (1987) Naval Research Logistics , vol.34 , Issue.4 , pp. 487-503
    • Hamacher, H.W.1    Tufekci, S.2
  • 9
    • 0015330635 scopus 로고
    • Theoretical improvements in algorithmic efficiency for network flow problems
    • April [Online] http://doi.acm.org/10.1145/321694.321699
    • J. Edmonds and R. M. Karp, "Theoretical improvements in algorithmic efficiency for network flow problems," J. ACM, vol. 19, pp. 248-264, April 1972. [Online]. Available: http://doi.acm.org/10.1145/321694.321699
    • (1972) J. ACM , vol.19 , pp. 248-264
    • Edmonds, J.1    Karp, R.M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.