|Table of Contents|

Bi-objective Path Finding Problem for Hazardous Materials Transportation Vehicles(PDF)

《南京师大学报(自然科学版)》[ISSN:1001-4616/CN:32-1239/N]

Issue:
2022年02期
Page:
81-90
Research Field:
·计算机科学与技术·
Publishing date:

Info

Title:
Bi-objective Path Finding Problem for Hazardous Materials Transportation Vehicles
Author(s):
Shen Liang1Wu Ting2Qin Zhaohui1Feng Yu3Shao Hu4Shao Feng4
(1.School of Management,Xuzhou Medical University,Xuzhou 221116,China)(2.Department of Mathematics,Nanjing University,Nanjing 210093,China)(3.China Coal Transportation and Marketing Association,Beijing 100013,China)(4.School of Mathematics,China Univer
Keywords:
traffic engineeringsafe and reliable pathK-shortest algorithminequality techniquehazardous materials transportation vehiclesstochastic traffic networks
PACS:
U268.6
DOI:
10.3969/j.issn.1001-4616.2022.02.010
Abstract:
This paper investigates the bi-objective path finding problem with simultaneous consideration of the reliability and safety issues for hazardous materials transportation vehicles in stochastic networks. Regarding the reliability issue,the stochastic link travel time(SLTT),the delays at intersections and traffic signals(DITS)and the correlations between SLTT and DITS are considered in reliable path finding problem. To address the safety issue,the number of people possibly affected around each link(PPAAL),the number of people possibly affected while using each link(PPAUL)and the correlations between PPAAL and PPAUL are considered in safe path finding problem. Due to the non-additive properties of the reliability and safety measures,this paper proposes a heuristic algorithm to solve the proposed multi-objective model using the mathematical deductions of inequalities and K-shortest algorithm. The proposed algorithm is designed to save the computational time and obtain the non-dominated solutions of the proposed model. Compared with the traditional model,the results of numerical example showed that ignoring the DITS and correlations may lead to basis results in finding the reliable shortest path and the safest path. Such basis results may cause serious economic loss and environmental harm. Finally,we demonstrate the performance of the proposed algorithm in real road traffic network by numerical simulation.

References:

[1] MA C X,ZHOU J B,XU X C,et al. Fleet scheduling optimization of hazardous materials transportation:a literature review[J]. Journal of advanced transportation,2020,Article ID:4079617.
[2]刘天亮,黄海军,陈剑. 考虑风险规避和认知更新的日常择路行为演进[J]. 交通运输工程学报,2008(4):90-94.
[3]陈喜群,刘教坤,胡浩强,等. 网络行程时间可靠性评价方法与影响因素[J]. 交通运输工程学报,2018,18(4):132-142.
[4]JOY D. Predicting transportation routes for radioactive wastes[J]. Waster management,1981,1:415-425.
[5]HALL R. The fastest path through a network with random time dependent travel times[J]. Transportation science,1986,20(3):182-188.
[6]TOUMAZIS I,KWON C. Routing hazardous materials on time-dependent networks using conditional value-at-risk[J]. Transportation research part C,2013,37(3):73-92.
[7]WEI M Y,LI X,YU L A. Time-dependent fuzzy random location-scheduling programming for hazardous materials transportation[J]. Transportation research part C,2015,57:146-165.
[8]FU L P,RILETT L R. Expected shortest paths in dynamic and stochastic traffic networks[J]. Transportation research part B,1998,32(7):499-516.
[9]CHANG T S,NOZICK L K,TURNQUIST M A. Multi-objective path finding in stochastic dynamic networks,with application to routing hazardous materials shipments[J]. Transportation science,2005,39(3):383-399.
[10]XU H L,ZHOU J,XU W. A decision-making rule for modeling travelers’ route choice behavior based on cumulative prospect theory[J]. Transportation research part C,2011,19:218-228.
[11]李健,周漪,刘威. 上海市历史城区震后应急救援路网评价与优化[J]. 交通运输系统工程与信息,2017,17(2):227-233.
[12]代存杰,李引珍,马昌喜,等. 随机时间依赖路网中危险品运输路径多准则优化[J]. 哈尔滨工业大学学报,2018,50(3):156-164.
[13]种鹏云,帅斌. 连环恐怖袭击下危险品运输网络级联失效建模[J]. 系统工程理论与实践,2014,34(4):1059-1065.
[14]ABKOWITZ M,CHENG P. Developing a risk/cost framework for routing truck movements of hazardous materials[J]. Accident analysis & prevention,1988,20(1):39-51.
[15]代存杰,李引珍,马昌喜,等. 不确定条件下危险品配送路线多准则优化[J]. 吉林大学学报(工学版),2018,48(6):1694-1702.
[16]SHAO H,LAM W,TAM M. A reliability-based stochastic traffic assignment model for network with multiple user classes under uncertainty in demand[J]. Networks and spatial economics,2006,6(3/4):173-204.
[17]朱宁,马寿峰,康迪. 基于排队依赖模型的车辆疏散问题研究[J]. 系统工程学报,2012,27(6):833-840.
[18]ASAKURA Y,KASHIWADANI M. Road network reliability caused by daily fluctuation of traffic flow[J]. European transport,highways & planning,1991,19:73-84.
[19]ZHU N,FU C Y,MA S F. Data-driven distributionally robust optimization approach for reliable travel-time-information-gain-oriented traffic sensor location model[J]. Transportation research part B,2018,113:91-120.
[20]SHEN L,SHAO H,WU T,et al. Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty[J]. Transportation research part E,2020,144:102159.
[21]SUN J,LIU H. Stochastic eco-routing in a signalized traffic network[J]. Transportation research part C,2015,59:32-47.
[22]YU S W,SHI Z K. An extended car-following model at signalized intersections[J]. Physica A-statistical mechanics and its applications,2014,407:152-159.
[23]YU S W,FU R,GAO Y S,et al. Consensus and optimal speed advisory model for mixed traffic at an isolated signalized intersection[J]. Physica A-statistical mechanics and its applications,2019,531:121789.
[24]HALL R. Travel outcome and performance:the effect of uncertainty on accessibility[J]. Transportation research part B. 1983,17(4):275-290.
[25]徐红利,周晶,徐薇. 考虑参考点依赖的随机网络用户均衡与系统演化[J]. 系统工程理论与实践,2010,30(12):1059-1065.
[26]徐薇,马萧宇,徐红利. 双目标用户均衡下的交通流逐日动态演化模型[J]. 管理科学学报,2020,23(7):116-126.
[27]王璐,朱宁. 基于高速公路事故预测的主动式巡逻车应急响应研究[J]. 交通信息与安全,2018,36(1):35-40.
[28]SHEN L,SHAO H,WU T,et al. An energy-efficient reliable path finding algorithm for stochastic road networks with electric vehicles[J]. Transportation research part C,2019,102:450-473.
[29]DIJKSTRA E. A note on two problems in connexion with graphs[J]. Numerische mathematik,1959,1:269-271.
[30]YANG H H,CHEN Y L. Finding ortest looping paths with waiting time in a time-window network[J]. Applied mathematical modelling,2006,30:458-465.

Memo

Memo:
-
Last Update: 1900-01-01