Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations

DOI10.1007/S11067-013-9195-5zbMATH Open1338.90051OpenAlexW2053656860MaRDI QIDQ298898FDOQ298898

Srinivas Peeta, Yu-Ting Hsu

Publication date: 21 June 2016

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-013-9195-5

zbMATH Keywords

clearance time estimationdynamic network flow problemevacuation risklocation-priority routingquickest flow

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Evacuation transportation planning under uncertainty: A robust optimization approach
• The quickest flow problem
• Note—Some Equivalent Objectives for Dynamic Network Flow Problems
• Earliest Arrival Flows with Multiple Sources
• Constructing Maximal Dynamic Flows from Static Flows

Cited In (3)

• A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions
• A-RESCUE: an agent based regional evacuation simulator coupled with user enriched behavior
• Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case

This page was built for publication: Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q298898)