中国安全科学学报 ›› 2023, Vol. 33 ›› Issue (9): 181-188.doi: 10.16265/j.cnki.issn1003-3033.2023.09.1503

• 公共安全 • 上一篇    下一篇

基于相异路径的危险品运输车辆调度

柴获(), 何瑞春, 贾晓燕, 代存杰   

  1. 兰州交通大学 交通运输学院,甘肃 兰州 730070
  • 收稿日期:2023-03-14 修回日期:2023-06-18 出版日期:2023-09-28
  • 作者简介:

    柴 获 (1982—),男,甘肃静宁人,博士,副教授,主要从事道路危险品运输路径优化和车辆调度、交通信息的组织和优化方面的研究。E-mail:

    何瑞春 教授

    贾晓燕 副教授

    代存杰 副教授

  • 基金资助:
    国家自然科学基金资助(71961015); 国家自然科学基金资助(52162041); 天津大学-兰州交通大学自主创新基金合作项目资助(2020054); 甘肃省教育厅“双一流”科研重点项目(GSSYLXM-04); 甘肃省高等学校青年博士基金资助(2022QB-065)

Vehicle scheduling for hazardous materials transportation based on dissimilar paths

CHAI Huo(), HE Ruichun, JIA Xiaoyan, DAI Cunjie   

  1. School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou Gansu 730070, China
  • Received:2023-03-14 Revised:2023-06-18 Published:2023-09-28

摘要:

为有效降低多车同时运输危险品时的潜在风险,针对危险品运输网络中2点间相异路径上多车运输问题,提出车辆安全出发时间间隔计算方法,通过路径选择和车辆调配,建立相异路径上多车同时运输车辆调度数学模型,并设计基于非支配排序遗传算法(NSGA-II)的多目标优化算法求解。以8个节点13条边的危险品运输网络中运输10车危险品为例,根据所提方法获得单次运输风险约束条件的运输方案13种,运输总风险约束条件下运输方案15种,对比不同风险约束下的运输风险、运输距离和运输时间。结果表明:相比于运输总风险约束,单次运输风险约束更严格,适合道路管理者筛选安全的运输路径,而运输总风险约束适合承运企业在车辆调度时作出决策。

关键词: 相异路径, 危险品运输, 车辆调度, 多目标优化, 非支配排序遗传算法(NSGA-II)

Abstract:

In order to effectively mitigate potential risks during the simultaneous transportation of hazardous materials by multiple vehicles, this study addressed the problem of simultaneous multi-vehicle transportation on distinct paths between 2 nodes within a hazardous materials transportation network. A method for calculating safe departure time intervals of vehicles was proposed to select paths and allocate vehicles. A mathematical model was established for simultaneously scheduling multiple vehicles to travel on different paths through path selection and vehicle allocation. A multiobjective optimization algorithm based on NSGA-II was designed for solving the proposed model. Using an example of transporting 10 hazardous material vehicles in an 8-node and 13-edge hazardous materials transportation network, the proposed method yielded 13 transportation schemes satisfying single-trip risk constraints and 15 transportation schemes satisfying total risk constraints. A comparative analysis was performed on transportation risk, distance, and time under different risk constraints. The results indicate that compared with the total risk constraints, the single-trip risk constraints are more stringent, which is suitable for road authorities to select safe transportation paths, while total risk constraints are suitable for carrier enterprises to make vehicle scheduling decisions.

Key words: hazardous materials transportation, vehicle scheduling, dissimilar paths, multi-objective optimization, non-dominated sorting genetic algorithm II(NSGA-II)