Transport network downsizing based on optimal sub-network

IF 14.5 Q1 TRANSPORTATION Communications in Transportation Research Pub Date : 2022-12-01 DOI:10.1016/j.commtr.2022.100079
Matthieu Guillot , Angelo Furno , El-Houssaine Aghezzaf , Nour-Eddin El Faouzi
{"title":"Transport network downsizing based on optimal sub-network","authors":"Matthieu Guillot ,&nbsp;Angelo Furno ,&nbsp;El-Houssaine Aghezzaf ,&nbsp;Nour-Eddin El Faouzi","doi":"10.1016/j.commtr.2022.100079","DOIUrl":null,"url":null,"abstract":"<div><p>Transportation networks are sized to efficiently achieve some set of service objectives. Under particular circumstances, such as the COVID-19 pandemic, the demand for transportation can significantly change, both qualitatively and quantitatively, resulting in an over-capacitated and less efficient network. In this paper, we address this issue by proposing a framework for resizing the network to efficiently cope with the new demand. The framework includes a model to determine an optimal transportation sub-network that guarantees the following: (i) the minimal access time from any node of the <em>urban network</em> to the new sub-network has <em>not excessively increased</em> compared to that of the original <em>transportation network</em>; (ii) the delay induced on any itinerary by the removal of nodes from the original transportation network has not <em>excessively increased</em>; and (iii) the number of removed nodes from the transportation network is within a preset known factor. A solution is optimal if it induces a minimal global delay. We modelled this problem as a Mixed Integer Linear Program and applied it to the public bus transportation network of Lyon, France, in a case study. In order to respond to operational issues, the framework also includes a decision tool that helps the network planners to decide which bus lines to close and which ones to leave open according to specific trade-off preferences. The results on real data in Lyon show that the optimal sub-network from the MILP model can be used to feed the decision tool, leading to operational scenarios for network planners.</p></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":"2 ","pages":"Article 100079"},"PeriodicalIF":14.5000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772424722000294/pdfft?md5=2996b5d7219565835804c81a1d716813&pid=1-s2.0-S2772424722000294-main.pdf","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications in Transportation Research","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2772424722000294","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TRANSPORTATION","Score":null,"Total":0}
引用次数: 4

Abstract

Transportation networks are sized to efficiently achieve some set of service objectives. Under particular circumstances, such as the COVID-19 pandemic, the demand for transportation can significantly change, both qualitatively and quantitatively, resulting in an over-capacitated and less efficient network. In this paper, we address this issue by proposing a framework for resizing the network to efficiently cope with the new demand. The framework includes a model to determine an optimal transportation sub-network that guarantees the following: (i) the minimal access time from any node of the urban network to the new sub-network has not excessively increased compared to that of the original transportation network; (ii) the delay induced on any itinerary by the removal of nodes from the original transportation network has not excessively increased; and (iii) the number of removed nodes from the transportation network is within a preset known factor. A solution is optimal if it induces a minimal global delay. We modelled this problem as a Mixed Integer Linear Program and applied it to the public bus transportation network of Lyon, France, in a case study. In order to respond to operational issues, the framework also includes a decision tool that helps the network planners to decide which bus lines to close and which ones to leave open according to specific trade-off preferences. The results on real data in Lyon show that the optimal sub-network from the MILP model can be used to feed the decision tool, leading to operational scenarios for network planners.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于最优子网络的传输网络精简
运输网络的大小是为了有效地实现一些服务目标。在特殊情况下,如2019冠状病毒病大流行,对交通运输的需求可能在质量和数量上发生重大变化,导致网络容量过剩,效率低下。在本文中,我们通过提出一个调整网络大小的框架来解决这个问题,以有效地应对新的需求。该框架包括一个确定最优交通子网络的模型,该模型保证:(i)从城市网络的任何节点到新子网络的最小访问时间与原始交通网络相比没有过度增加;(二)从原交通网络移除节点所造成的任何行程延误没有过度增加;(iii)从交通网络中移除的节点数量在预设的已知因子范围内。如果一个解决方案引起最小的全局延迟,那么它就是最优的。我们将这个问题建模为一个混合整数线性规划,并将其应用于法国里昂的公共汽车交通网络,作为一个案例研究。为了应对运营问题,该框架还包括一个决策工具,帮助网络规划者根据具体的权衡偏好决定关闭哪些公交线路,保留哪些线路。里昂实际数据的结果表明,MILP模型的最优子网络可用于为决策工具提供信息,从而为网络规划者提供操作场景。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
15.20
自引率
0.00%
发文量
0
期刊最新文献
Interpretable machine learning for traffic congestion prediction: Unveiling the impact of different COVID-19 periods Machine learning-based real-time crash risk forecasting for pedestrians Quantitative assessment of mid-air collision probability in urban air mobility: A safety barrier-based framework for integrated operations Multimodal traffic assignment from privacy-protected OD data MoTIF: An end-to-end multimodal road traffic scene understanding foundation model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1