检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]兰州交通大学交通运输学院,甘肃兰州730070
出 处:《兰州交通大学学报》2013年第1期133-137,共5页Journal of Lanzhou Jiaotong University
基 金:甘肃省青年基金(1208RJYA060);甘肃省青年基金(2011GS04256);兰州市科技局研发产合作支撑计划项目(2011-1-111);教育部人文社会科学研究规划基金(11YJAZH132)
摘 要:将应急物资运输划分为以救助生命为主要任务的Ⅰ阶段和以安置灾民为主要任务的Ⅱ阶段,Ⅰ阶段应急物资运输以时间最短且运量最大为目标,Ⅱ阶段应急物资运输以成本最小且运量最大为目标.同时,构建多式联运运输网络,以多出救点-单受灾点的问题为背景,考虑运输方式的多样性,建立应急物资两阶段多目标调度模型,结合实例设计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.
关 键 词:应急物资 多式联运 Ⅱ阶段法 路网可靠性 DIJKSTRA算法
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.177