摘要
将应急物资运输划分为以救助生命为主要任务的Ⅰ阶段和以安置灾民为主要任务的Ⅱ阶段,Ⅰ阶段应急物资运输以时间最短且运量最大为目标,Ⅱ阶段应急物资运输以成本最小且运量最大为目标.同时,构建多式联运运输网络,以多出救点-单受灾点的问题为背景,考虑运输方式的多样性,建立应急物资两阶段多目标调度模型,结合实例设计Dijkstra算法分别求解,验证上述模型的有效性.
Emergency supply transportation is divided into two stages, among which, stage I takes saving lives as the main task and housing the victims is the main job of the stage Ⅱ. As the result,the object of stage I should be ＂the minimum transportation time and the maximum transportation amount＂ and the object of stage Ⅱ should be ＂the minimum transportation cost and the maximum transportation amount＂. Meanwhile,the transport network of multimodal transportation is constructed in the paper, which makes the problem of more save points-a single affected point as background, and a two-stage scheduling model for emergency supplies is established considering the diversity of transportation mode. And then, Dijkstra algorithm is designed to solve the two scheduling models. Taking extracted example proves the validity of the above models and algorithms.
出处
《兰州交通大学学报》
CAS
2013年第1期133-137,共5页
Journal of Lanzhou Jiaotong University
基金
甘肃省青年基金(1208RJYA060)
甘肃省青年基金(2011GS04256)
兰州市科技局研发产合作支撑计划项目(2011-1-111)
教育部人文社会科学研究规划基金(11YJAZH132)
关键词
应急物资
多式联运
Ⅱ阶段法
路网可靠性
DIJKSTRA算法
emergency supply
multimodal transportation
two-stage scheduling model
network reliabili-ty
Dijkstra algorithm
