时变条件下有害物品运输的路径选择与决策  

Multi-Objective Optimization and Path Selection of Hazardous Materials Transportation Under Time-Varying Conditions

作　　者：李飘 于影霞 Li Piao;Yu Yingxia(School of Transportation and Logistics,East China Jiaotong University,Nanchang 330013,China)

机构地区：[1]华东交通大学交通运输与物流学院,江西南昌330013

出　　处：《华东交通大学学报》2021年第1期79-87,共9页Journal of East China Jiaotong University

基　　金：国家自然科学基金项目(71861011)。

摘　　要：为解决传统的路径规划中,目标少、静态性,无法真实模拟现实情境的问题。研究了时变条件下,同时考虑成本、环境风险、人口风险的多目标路径优化及选择问题。建立了时变条件下多个不同出发时间且有到达时间限制的有害物品运输的多目标最短路径选择的数学模型;设计了该模型下的相关算法;考虑到实际决策环境的复杂度以及决策者理性的有限性,提出了综合k-最短路径算法和逼近理想解排序法(TOPSIS法)的算法,用k-最短路径算法分别确定各单目标的有效路径,再用TOPSIS法计算各有效路径到正负理想解的欧氏距离以及贴近度,比较优选决策者满意的路径。最后通过一个算例,证明所提出的模型是有效的。In order to solve the problem of less target,static circumstance and real situation cannot be simulated in traditional path planning,under the background of the time-varying conditions,cost,environmental risk and population risk were considered in the multi-objective path optimization and selection.A mathematical model of multi-objective shortest path selection problem with time-varying conditions and multiple departure time(segmentation time)for hazardous goods transportation was established and designed.Considering the complexity of the actual decision-making environment and the limitation of the rationality of the decision-makers,the algorithm of comprehensive k-shortest path and approximating ideal solution sorting method(TOPSIS method)was proposed.The effective path of each single target was determined by k-shortest path algorithm.Then,the effective path to the positive and negative ideal solutions was calculated by TOPSIS method.Finally,an application example was given to prove the effectiveness of the proposed model.

关 键 词：时变网络 有害物品运输 多目标优化 扩展型Dijkstra法 k-最短路径 TOPSIS法 路径选择 

分 类 号：U16[交通运输工程] X951[环境科学与工程—安全科学]