摘要
疏散交通路线的确定是应急计划的重要内容,以往有关最佳疏散交通路线的研究没有充分考虑交叉口延误和通行能力等因素,若疏散路线经过城市内拥挤路段,忽略交叉口的这些特性会导致结果不尽合理。将交叉口分方向延误和通行能力作为节点权重,用点权网络表示疏散涉及到的道路网,建立了点权交通网络中的最小费用流模型描述城市内事故地点至接收点的人群及其产生的车流的疏散路线问题;设计了求解这种最小费用流的最小费用路算法,通过求解点权交通网络中的最小费用流,得出事故地点至安全接收地点的最佳疏散交通路线及相应的疏散流量。最后以一个数值算例说明了模型和算法的具体应用。
Establishment of evacuation routes is an important part of emergency plan. Most studies on evacuation routes do not explicitly consider intersection delays and capacity in calculating best evacuation routes. However, in congested road networks, delays and capacity limitations at intersections may be significant, and ignoring them may lead the calculation to the illogical routes. Considering delays and capacity at intersections, a special network with node weights which represent the delays and capacities at the intersections is constructed. A minimum cost flow model of such network is presented to describe the problem of population evacuation from given evacuation sources to receptions. A successive shortest path algorithm is designed for the model, and through searching the minimum cost flow, the best population evacuation routes and corresponding evacuation flow between evacuation sources and receptions can be determined. A numerical network example is given at last.
出处
《系统工程》
CSCD
北大核心
2006年第9期6-10,共5页
Systems Engineering
关键词
疏散路线
交叉口
点权变通网络
最小费用路算法
Evacuation Routes
Intersection
Network with Weight at Nodes
Successive Shortest Path Algorithm
