A Quickest Flow Model for Evacuation Route and Departure Schedule Planning
As an important part of emergency management, the regional evacuation process indeed involves movement of people by vehicles, which may generate large plenty of traffic trips during limited time. Efficient tools are needed to establish evacuation routing plans that identify routes and departure schedules for Evacuation vehicles to ensure safety and order. In previous study, network flow models modified to incorporate movement costs at intersections as well as classical ones have both been used. But most of them cannot consider movements at intersections and dynamic impedance of road network simultaneously. A modified quickest flow model is proposed to optimize departure time and evacuation route for vehicles, in which dynamic impedance and costs of intersection movements are incorporated. A heuristic algorithm is presented, which models capacity as a time series and finds suboptimal routing plans by searching dynamic routes with earliest arrival time, establishing the flows (vehicles) assigned to it and modifying capacity, iteratively. A numerical example is given.
Regional evacuation Route and departure schedule Dynamic impedance Movement of intersectin Quickest flow mode
Mingxia Gao Junwen Mo
School of traffic and transportation Lanzhou Jiaotong University Lanzhou, China School of civil engineering Lanzhou Jiaotong University Lanzhou, China
国际会议
三峡
英文
498-501
2012-05-18（万方平台首次上网日期，不代表论文的发表时间）