公交系统应对时变道路中断的替代服务网络设计

IF 5.8 1区 工程技术 Q1 ECONOMICS Transportation Research Part B-Methodological Pub Date : 2024-08-17 DOI:10.1016/j.trb.2024.103042
Hankun Zheng, Huijun Sun, Jianjun Wu, Liujiang Kang
{"title":"公交系统应对时变道路中断的替代服务网络设计","authors":"Hankun Zheng,&nbsp;Huijun Sun,&nbsp;Jianjun Wu,&nbsp;Liujiang Kang","doi":"10.1016/j.trb.2024.103042","DOIUrl":null,"url":null,"abstract":"<div><p>In practice, road disruptions occur frequently, interrupting multiple bus routes at the same time and causing widespread passenger delays. Typically, these disrupted roads are repaired sequentially and then gradually put into service. In response to such time-varying road disruptions, this paper aims to assist bus operators in developing effective alternative service networks for passengers. The proposed approach involves the joint optimization of service-based route adjustments, bus timetables, and passenger assignment to minimize the total passenger cost and weighted bus operation time. Specifically, a novel service-based adjustment strategy is introduced to flexibly adapt each bus service to time-varying road disruptions. An integer programming model is built for the studied problem based on the set of passengers’ time-space itineraries. To efficiently generate these time-space itineraries and solve models for large-scale problems, this paper develops a hierarchical solution framework. The framework consists of three key parts: (1) a column generation procedure to iteratively explore passengers’ spatial paths; (2) a customized extension algorithm to extend these spatial paths to time-space itineraries; and (3) a tailored adaptive large neighbourhood search heuristic to solve the final itinerary-based model. After that, the overall methodology is tested with both an illustrative example and a real-world example in Beijing. Experimental results show that our methodology produces a high-performance solution with only 7.3% of unserved passengers. Besides, compared to the two benchmark adjustment strategies, our service-based adjustment strategy reduces the average itinerary cost for all passengers by 27.0% and 43.3%, respectively.</p></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"188 ","pages":"Article 103042"},"PeriodicalIF":5.8000,"publicationDate":"2024-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Alternative service network design for bus systems responding to time-varying road disruptions\",\"authors\":\"Hankun Zheng,&nbsp;Huijun Sun,&nbsp;Jianjun Wu,&nbsp;Liujiang Kang\",\"doi\":\"10.1016/j.trb.2024.103042\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In practice, road disruptions occur frequently, interrupting multiple bus routes at the same time and causing widespread passenger delays. Typically, these disrupted roads are repaired sequentially and then gradually put into service. In response to such time-varying road disruptions, this paper aims to assist bus operators in developing effective alternative service networks for passengers. The proposed approach involves the joint optimization of service-based route adjustments, bus timetables, and passenger assignment to minimize the total passenger cost and weighted bus operation time. Specifically, a novel service-based adjustment strategy is introduced to flexibly adapt each bus service to time-varying road disruptions. An integer programming model is built for the studied problem based on the set of passengers’ time-space itineraries. To efficiently generate these time-space itineraries and solve models for large-scale problems, this paper develops a hierarchical solution framework. The framework consists of three key parts: (1) a column generation procedure to iteratively explore passengers’ spatial paths; (2) a customized extension algorithm to extend these spatial paths to time-space itineraries; and (3) a tailored adaptive large neighbourhood search heuristic to solve the final itinerary-based model. After that, the overall methodology is tested with both an illustrative example and a real-world example in Beijing. Experimental results show that our methodology produces a high-performance solution with only 7.3% of unserved passengers. Besides, compared to the two benchmark adjustment strategies, our service-based adjustment strategy reduces the average itinerary cost for all passengers by 27.0% and 43.3%, respectively.</p></div>\",\"PeriodicalId\":54418,\"journal\":{\"name\":\"Transportation Research Part B-Methodological\",\"volume\":\"188 \",\"pages\":\"Article 103042\"},\"PeriodicalIF\":5.8000,\"publicationDate\":\"2024-08-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part B-Methodological\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0191261524001668\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part B-Methodological","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0191261524001668","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

摘要

实际上,道路中断经常发生,会同时中断多条公交线路,造成大面积的乘客延误。通常情况下,这些中断的道路会依次修复,然后逐步投入使用。针对这种时变的道路中断情况,本文旨在帮助巴士运营商为乘客开发有效的替代服务网络。所提出的方法涉及基于服务的线路调整、巴士时刻表和乘客分配的联合优化,以最大限度地降低总乘客成本和加权巴士运营时间。具体来说,该方法引入了一种新颖的基于服务的调整策略,使每条公交线路都能灵活适应随时间变化的道路中断情况。根据乘客的时空行程集,为所研究的问题建立了一个整数编程模型。为了有效生成这些时空行程并解决大规模问题的模型,本文开发了一个分层求解框架。该框架由三个关键部分组成:(1) 用于迭代探索乘客空间路径的列生成程序;(2) 用于将这些空间路径扩展为时空行程的定制扩展算法;以及 (3) 用于求解基于行程的最终模型的定制自适应大邻域搜索启发式。之后,我们用一个示例和一个北京的实际例子对整个方法进行了测试。实验结果表明,我们的方法产生了一个高性能的解决方案,仅有 7.3% 的乘客未得到服务。此外,与两种基准调整策略相比,我们基于服务的调整策略使所有乘客的平均行程成本分别降低了 27.0% 和 43.3%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Alternative service network design for bus systems responding to time-varying road disruptions

In practice, road disruptions occur frequently, interrupting multiple bus routes at the same time and causing widespread passenger delays. Typically, these disrupted roads are repaired sequentially and then gradually put into service. In response to such time-varying road disruptions, this paper aims to assist bus operators in developing effective alternative service networks for passengers. The proposed approach involves the joint optimization of service-based route adjustments, bus timetables, and passenger assignment to minimize the total passenger cost and weighted bus operation time. Specifically, a novel service-based adjustment strategy is introduced to flexibly adapt each bus service to time-varying road disruptions. An integer programming model is built for the studied problem based on the set of passengers’ time-space itineraries. To efficiently generate these time-space itineraries and solve models for large-scale problems, this paper develops a hierarchical solution framework. The framework consists of three key parts: (1) a column generation procedure to iteratively explore passengers’ spatial paths; (2) a customized extension algorithm to extend these spatial paths to time-space itineraries; and (3) a tailored adaptive large neighbourhood search heuristic to solve the final itinerary-based model. After that, the overall methodology is tested with both an illustrative example and a real-world example in Beijing. Experimental results show that our methodology produces a high-performance solution with only 7.3% of unserved passengers. Besides, compared to the two benchmark adjustment strategies, our service-based adjustment strategy reduces the average itinerary cost for all passengers by 27.0% and 43.3%, respectively.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Transportation Research Part B-Methodological
Transportation Research Part B-Methodological 工程技术-工程:土木
CiteScore
12.40
自引率
8.80%
发文量
143
审稿时长
14.1 weeks
期刊介绍: Transportation Research: Part B publishes papers on all methodological aspects of the subject, particularly those that require mathematical analysis. The general theme of the journal is the development and solution of problems that are adequately motivated to deal with important aspects of the design and/or analysis of transportation systems. Areas covered include: traffic flow; design and analysis of transportation networks; control and scheduling; optimization; queuing theory; logistics; supply chains; development and application of statistical, econometric and mathematical models to address transportation problems; cost models; pricing and/or investment; traveler or shipper behavior; cost-benefit methodologies.
期刊最新文献
Economic analysis of parking, vehicle charging and vehicle-to-grid services in the era of electric vehicles A novel data fusion method to leverage passively-collected mobility data in generating spatially-heterogeneous synthetic population The drone scheduling problem in shore-to-ship delivery: A time discretization-based model with an exact solving approach Modelling the impacts of en-route ride-pooling service in a mixed pooling and non-pooling market Amachine learning technique embedded reference-dependent choice model for explanatory power improvement: Shifting of reference point as a key factor in vehicle purchase decision-making
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1