An Universally Maximal Flow Model for Evacuation Route Planning

• 1、School of traffic and transportation, Lanzhou Jiaotong University, LanZhou 730070

Abstract：Evacuation plays an important role in emergency management, and efficient tools are needed to identify routes and departure schedules for evacuation vehicles to guarantee safety and efficiency. Most research works on such problem do not explicitly consider delay and capacity at intersections. However, in congested street networks, turning movement delays and capacity at intersections may be significant, and ignoring them may lead to the calculation of suboptimal or illogical routing plans. With turning delay and capacity at intersections as weights of node, the evacuation road network is expressed as a network with directional node-weight and the problem of finding optimal evacuation routing plans is described as a special universally maximal flow problem. A algorithm is presented to find the optimal route and departure schedule by maximizing the flow arriving at sink by all time t in study period (namely the universally maximal flow over time), which is done by modifying the classical one that do not deal with weights at nodes. A numerical example is given.

keywords： traffic and transpoortation planning and managemet emergency evacuation departure schedule and route universally maximal flow delay and capacity at intersections network with node-weight

点击查看论文中文信息

点击收起