메뉴 건너뛰기




Volumn 216, Issue 1, 2012, Pages 57-69

Pattern-based evacuation planning for urban areas

Author keywords

Evacuation planning; Heuristics; Mathematical modeling; Networks

Indexed keywords

AFFECTED AREA; DYNAMIC NETWORK FLOW; EVACUATION PLANNING; HEURISTIC SOLUTIONS; HEURISTICS; MATHEMATICAL MODELING; MIXED INTEGER; NUCLEAR ACCIDENTS; TIME HORIZONS; TRAFFIC ROUTING; TWO STAGE; URBAN AREAS;

EID: 80052772711     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.07.015     Document Type: Article
Times cited : (49)

References (27)
  • 4
    • 34548497385 scopus 로고    scopus 로고
    • Real-time mobilization decisions for multi-priority emergency response resources and evacuation groups: Model formulation and solution
    • DOI 10.1016/j.tre.2006.11.006, PII S136655450700018X, Challenges of Emergency Logistics Management
    • Y.-C. Chiu, and H. Zheng Real-time mobilization decisions for multi-priority emergency response resources and evacuation groups: Model formulation and solution Transportation Research Part E: Logistics and Transportation Review 43 6 2007 710 736 Challenges of Emergency Logistics Management (Pubitemid 47371967)
    • (2007) Transportation Research Part E: Logistics and Transportation Review , vol.43 , Issue.6 , pp. 710-736
    • Chiu, Y.-C.1    Zheng, H.2
  • 6
    • 0037933474 scopus 로고    scopus 로고
    • A network flow model for lane-based evacuation routing
    • DOI 10.1016/S0965-8564(03)00007-7
    • T. Cova, and J. Johnson A network flow model for lane-based evacuation routing Transportation Research Part A: Policy and Practice 37 7 2003 579 604 (Pubitemid 36743282)
    • (2003) Transportation Research Part A: Policy and Practice , vol.37 , Issue.7 , pp. 579-604
    • Cova, T.J.1    Johnson, J.P.2
  • 7
    • 0028803659 scopus 로고
    • The cell transmission model part II: Network traffic
    • C.F. Daganzo The cell transmission model part II: Network traffic Transportation Research B 29B 2 1995 79 93
    • (1995) Transportation Research B , vol.29 B , Issue.2 , pp. 79-93
    • Daganzo, C.F.1
  • 8
    • 0001424107 scopus 로고
    • Constructing maximal dynamic flows from static flows
    • J.L.R. Ford, and D.R. Fulkerson Constructing maximal dynamic flows from static flows Operations Research 6 3 1958 419 433
    • (1958) Operations Research , vol.6 , Issue.3 , pp. 419-433
    • Ford, J.L.R.1    Fulkerson, D.R.2
  • 9
    • 0006075627 scopus 로고
    • Transient flows in networks
    • D. Gale Transient flows in networks Michigan Mathematical Journal 6 1 1959 59 63
    • (1959) Michigan Mathematical Journal , vol.6 , Issue.1 , pp. 59-63
    • Gale, D.1
  • 10
    • 3042576795 scopus 로고    scopus 로고
    • Mathematical Modeling of Evacuation Problems: A State of Art
    • Nr.
    • Hamacher, H.; Tjandra, S.; 2001. Mathematical Modeling of Evacuation Problems: A State of Art, Berichte des Frauenhofer ITWM, Nr. 24.
    • (2001) Berichte des Frauenhofer ITWM , vol.24
    • Hamacher, H.1    Tjandra, S.2
  • 11
    • 33845411054 scopus 로고    scopus 로고
    • Global optimization of emergency assignments
    • L.D. Han, F. Yuan, S. Chin, and H. Hwang Global optimization of emergency assignments Interfaces 36 6 2006 502 513
    • (2006) Interfaces , vol.36 , Issue.6 , pp. 502-513
    • Han, L.D.1    Yuan, F.2    Chin, S.3    Hwang, H.4
  • 13
    • 0028196203 scopus 로고
    • Polynomial time algorithms for some evacuation
    • Arlington, Virginia, United States, Arlington, Virginia, United States
    • Hoppe, B.; Tardos, E.; 1994. Polynomial time algorithms for some evacuation problems. In: Proceedings of the fifth Annual ACM-SIAM Symposium on Discrete Algorithms 1994, Arlington, Virginia, United States, Arlington, Virginia, United States, pp. 433-441.
    • (1994) Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms 1994 , pp. 433-441
    • Hoppe, B.1    Tardos, E.2
  • 14
    • 0343675992 scopus 로고
    • Some equivalent objectives for dynamic network flow problems
    • J.J. Jarvis, and H.D. Ratliff Some equivalent objectives for dynamic network flow problems Management Science 28 1 1982 106 108
    • (1982) Management Science , vol.28 , Issue.1 , pp. 106-108
    • Jarvis, J.J.1    Ratliff, H.D.2
  • 17
    • 80052755749 scopus 로고    scopus 로고
    • A Fast Heuristic Approach for Large Scale Cell-Transmission-Based Evacuation Planning
    • University of Duisburg-Essen
    • Kimms, A.; Maassen, K.-C.; 2010. A Fast Heuristic Approach for Large Scale Cell-Transmission-Based Evacuation Planning. Working Paper, University of Duisburg-Essen.
    • (2010) Working Paper
    • Kimms, A.1    Maassen, K.-C.2
  • 18
    • 79959686835 scopus 로고    scopus 로고
    • Optimization and simulation of traffic flows in the case of evacuating urban areas
    • A. Kimms, and K.-C. Maassen Optimization and simulation of traffic flows in the case of evacuating urban areas OR Spectrum 33 2011 571 593
    • (2011) OR Spectrum , vol.33 , pp. 571-593
    • Kimms, A.1    Maassen, K.-C.2
  • 22
    • 64849097179 scopus 로고    scopus 로고
    • An introduction to network flows over time
    • W.J. Cook, L. Lovasz, J. Vygen, Springer Berlin
    • M. Skutella An introduction to network flows over time W.J. Cook, L. Lovasz, J. Vygen, Research Trends in Combinatorial Optimization 2008 Springer Berlin 451 482
    • (2008) Research Trends in Combinatorial Optimization , pp. 451-482
    • Skutella, M.1
  • 25
  • 26
    • 34247161014 scopus 로고    scopus 로고
    • Two-way road network design problem with variable lanes
    • DOI 10.1007/s11518-007-5034-x
    • H. Zhang, and Z. Gao Two-way road network design problem with variable lanes Journal of Systems Science and Systems Engineering 16 1 2007 50 61 (Pubitemid 46599157)
    • (2007) Journal of Systems Science and Systems Engineering , vol.16 , Issue.1 , pp. 50-61
    • Zhang, H.1    Gao, Z.2
  • 27
    • 0033904403 scopus 로고    scopus 로고
    • A linear programming model for the single destination system optimum dynamic traffic assignment problem
    • A.K. Ziliaskopoulos A linear programming model for the single destination system optimum dynamic traffic assignment problem Transportation Science 34 1 2000 37
    • (2000) Transportation Science , vol.34 , Issue.1 , pp. 37
    • Ziliaskopoulos, A.K.1


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