摘要
基于我国城市家庭小汽车普及率低的现状,构建停车场、车站以及避难所三者组成的疏散网络。以车辆总疏散行程时间最小为目标,建立以公共交通工具(客车)作为主要工具的紧急疏散路径优化模型,并设计基于最小费用、最大流的求解算法。通过算例说明模型和算法的有效性和可行性,并得到在给定的疏散路网方案情况下,停车场现存车数、车站所需车辆数以及避难所容车数的变化,会引起所有客车最短径路选择变化的结论。
For the situation of low car ownership rates in Chinese cities, an evacuation network combining with the parking lots, stations and shelters is formulated. Aiming at minimizing the total evacuation travel time, a path choice optimization model of the public transportation vehicles （here the buses） for evacuation is established, as well as its solution algorithm via the Max-flow/Min-cost model. The feasibilities and the effectiveness of both the optimization model and its solution algorithm are evaluated by a case study. This study indicates that changing the number of available vehicles at parking places, the required vehicles at stations and the capacities of shelters, will result in the changes in shortest paths choices of transit vehicles.
出处
《交通信息与安全》
2009年第5期85-89,共5页
Journal of Transport Information and Safety
基金
国家高技术研究发展计划(863计划)项目(批准号:2006AA11Z203)
霍英东基金项目(批准号:104007)
北京交通大学重点积极资助项目(批准号:2006XZ004)资助
关键词
交通工程
应急管理
疏散计划
路径选择
最小费用最大流
traffic engineering
emergency management
evacuation plan
path choice
max-flow at rain-cost
