Managing oversaturation in BRT corridors: A new approach of timetabling for resilience enhancement using a tailored integer L-shaped algorithm

IF 6 2区 管理学 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Yiran Wang, Pengli Mo, Jingxu Chen, Zhiyuan Liu
{"title":"Managing oversaturation in BRT corridors: A new approach of timetabling for resilience enhancement using a tailored integer L-shaped algorithm","authors":"Yiran Wang,&nbsp;Pengli Mo,&nbsp;Jingxu Chen,&nbsp;Zhiyuan Liu","doi":"10.1016/j.ejor.2024.07.035","DOIUrl":null,"url":null,"abstract":"<div><p>Bus rapid transit (BRT) is a high-capacity public transport system that typically operates along urban transit corridors with dense travel demand. Maintaining the efficiency and stability of the BRT is paramount for daily transport operations. Owing to the difficulty in ensuring an exclusive right-of-way along the entire route, stochastic congestion events may occur resulting from road segments without dedicated BRT lanes. This may lead to volatility in travel time and resulting in passenger stranding, determined as common-case disruptions in this study. These common-case disruptions frequently occur in the daily operation of oversaturated BRT routes. To manage and mitigate their negative impacts, a novel timetabling problem for enhancing the resilience of a BRT system was proposed to assess the ability of the system to withstand and recover from these disruptions. We formulated the problem as a two-stage stochastic mixed-integer optimization model and designed an exact algorithm based on a tailored integer L-shaped method. We then analyzed the structural properties of our model and developed several acceleration techniques to further improve the efficiency of the algorithm. The computational results show that the proposed algorithm outperforms the commercial solver in large-scale instances and can provide near-optimal solutions when the commercial solver is invalid. Besides, external comparisons with dynamic programming also demonstrate the superiority of the proposed algorithm in solution efficiency. Compared with the benchmark timetabling problem, which aims to reduce passenger waiting time, the proposed method can efficiently reduce the duration of the oversaturation period by 35.3%.</p></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0000,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Operational Research","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0377221724005964","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Bus rapid transit (BRT) is a high-capacity public transport system that typically operates along urban transit corridors with dense travel demand. Maintaining the efficiency and stability of the BRT is paramount for daily transport operations. Owing to the difficulty in ensuring an exclusive right-of-way along the entire route, stochastic congestion events may occur resulting from road segments without dedicated BRT lanes. This may lead to volatility in travel time and resulting in passenger stranding, determined as common-case disruptions in this study. These common-case disruptions frequently occur in the daily operation of oversaturated BRT routes. To manage and mitigate their negative impacts, a novel timetabling problem for enhancing the resilience of a BRT system was proposed to assess the ability of the system to withstand and recover from these disruptions. We formulated the problem as a two-stage stochastic mixed-integer optimization model and designed an exact algorithm based on a tailored integer L-shaped method. We then analyzed the structural properties of our model and developed several acceleration techniques to further improve the efficiency of the algorithm. The computational results show that the proposed algorithm outperforms the commercial solver in large-scale instances and can provide near-optimal solutions when the commercial solver is invalid. Besides, external comparisons with dynamic programming also demonstrate the superiority of the proposed algorithm in solution efficiency. Compared with the benchmark timetabling problem, which aims to reduce passenger waiting time, the proposed method can efficiently reduce the duration of the oversaturation period by 35.3%.

管理快速公交走廊的过饱和问题:利用量身定制的整数 L 型算法编制时间安排以提高复原力的新方法
快速公交系统(BRT)是一种大容量公共交通系统,通常在出行需求密集的城市交通走廊上运行。保持快速公交的效率和稳定性对于日常交通运营至关重要。由于难以确保整条线路的专用路权,没有快速公交专用道的路段可能会出现随机拥堵事件。这可能会导致行车时间波动,造成乘客滞留,在本研究中被确定为常见的中断情况。在超饱和快速公交线路的日常运营中,经常会出现这些常见的中断情况。为了管理和减轻其负面影响,我们提出了一个新颖的时间安排问题,以增强快速公交系统的弹性,评估系统抵御这些中断并从中恢复的能力。我们将该问题表述为一个两阶段随机混合整数优化模型,并设计了一种基于定制整数 L 型方法的精确算法。然后,我们分析了模型的结构特性,并开发了几种加速技术来进一步提高算法的效率。计算结果表明,所提出的算法在大规模实例中的性能优于商用求解器,并能在商用求解器无效时提供接近最优的解决方案。此外,与动态编程的外部比较也证明了所提算法在求解效率方面的优势。与以减少乘客等待时间为目标的基准时刻表编制问题相比,所提出的方法可以有效地减少 35.3% 的超饱和期。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
European Journal of Operational Research
European Journal of Operational Research 管理科学-运筹学与管理科学
CiteScore
11.90
自引率
9.40%
发文量
786
审稿时长
8.2 months
期刊介绍: The European Journal of Operational Research (EJOR) publishes high quality, original papers that contribute to the methodology of operational research (OR) and to the practice of decision making.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信