Which route is better for hazmat transporting? An optimized routing index for urban networks

Morteza Asadamraji, Sheida Roshankhah
{"title":"Which route is better for hazmat transporting? An optimized routing index for urban networks","authors":"Morteza Asadamraji, Sheida Roshankhah","doi":"10.1680/jmuen.23.00015","DOIUrl":null,"url":null,"abstract":"The safety of vehicles and citizens on urban road network is a major subject, especially if this vehicle carries hazardous material. The paper focuses on developing an optimised index to identify the safest routes between any origin-destination pair within urban networks. The considered parameters include population, traffic safety, volume-capacity ratio, emergency response time, type of hazardous material (hazmat), and sensitive and vulnerable places. Notably, this study is the first to incorporate the last two parameters and the combination of all parameters in route optimization. The research formulates a Hazardous Material Vehicle Routing Problem (HMVRP) and proposes an algorithm to solve it. The approach is applied to a case study in Mashhad city, presenting the safest routes for transporting three types of hazardous materials. The findings indicate that the reduction in average risk score is comparable to the increase in average travel time, however, gain of the safest routes is lower than loss of the longer distance. The proposed method is practical and applicable to diverse urban networks, aiding in the routing and planning of any hazmat type transportation.","PeriodicalId":514711,"journal":{"name":"Proceedings of the Institution of Civil Engineers - Municipal Engineer","volume":"104 31","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Institution of Civil Engineers - Municipal Engineer","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1680/jmuen.23.00015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The safety of vehicles and citizens on urban road network is a major subject, especially if this vehicle carries hazardous material. The paper focuses on developing an optimised index to identify the safest routes between any origin-destination pair within urban networks. The considered parameters include population, traffic safety, volume-capacity ratio, emergency response time, type of hazardous material (hazmat), and sensitive and vulnerable places. Notably, this study is the first to incorporate the last two parameters and the combination of all parameters in route optimization. The research formulates a Hazardous Material Vehicle Routing Problem (HMVRP) and proposes an algorithm to solve it. The approach is applied to a case study in Mashhad city, presenting the safest routes for transporting three types of hazardous materials. The findings indicate that the reduction in average risk score is comparable to the increase in average travel time, however, gain of the safest routes is lower than loss of the longer distance. The proposed method is practical and applicable to diverse urban networks, aiding in the routing and planning of any hazmat type transportation.
哪条路线更适合危险品运输?城市网络的优化路由指数
城市路网中车辆和市民的安全是一个重要课题,尤其是当车辆载有危险品时。本文的重点是开发一个优化指数,以确定城市路网中任何一对起点-终点之间的最安全路线。考虑的参数包括人口、交通安全、运量容量比、应急响应时间、危险品(危险品)类型以及敏感和脆弱地点。值得注意的是,本研究首次将后两个参数以及所有参数的组合纳入路线优化。研究提出了危险品车辆路线问题(HMVRP),并提出了一种算法来解决该问题。该方法被应用于马什哈德市的一个案例研究,提出了运输三种危险材料的最安全路线。研究结果表明,平均风险分数的降低与平均旅行时间的增加相当,但最安全路线的收益低于长距离的损失。所提出的方法切实可行,适用于各种城市网络,有助于任何危险品运输的路线选择和规划。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信