Integrating short-turning strategy into timetabling for first train coordination in subway networks

IF 7.2 1区 工程技术 Q1 ECONOMICS
Hao Li , Norman Weik , Liujiang Kang , Yue Zhao , Huijun Sun
{"title":"Integrating short-turning strategy into timetabling for first train coordination in subway networks","authors":"Hao Li ,&nbsp;Norman Weik ,&nbsp;Liujiang Kang ,&nbsp;Yue Zhao ,&nbsp;Huijun Sun","doi":"10.1016/j.tra.2025.104851","DOIUrl":null,"url":null,"abstract":"<div><div>Ensuring connectivity in extended and continuously growing subway networks during the early morning start-up period becomes more and more challenging due to the limited number of trains and increasing infrastructure restrictions. In the present paper, train coordination strategies to maximize the connectivity of all origin-destination (OD) pairs and their effectiveness are investigated. An integrated mixed-integer nonlinear programming model is developed to simultaneously optimize short-turning plans and first train timetables. The model takes into account travel path choices between OD pairs and the impact of short-turning trains on ride plans. As the number of potential short-turning plans grows exponentially, computing an optimal solution incorporating all possible timetable schemes will be nearly impossible. As a result, a hierarchical two-stage optimization framework is developed to improve train short-turning and timetable coordination, which combines a breadth-first branch-and-cut algorithm for generating short-turning plans with a customized column generation algorithm for determining optimal train timetable coordination. To investigate the influence of network structure on coordination, we conducted two case studies with distinct network characteristics: Munich (shared-corridor network) and Beijing (grid network). The experimental results show that the proposed short-turning strategy effectively improves operational efficiency in both networks. Furthermore, comprehensive comparisons of solution accuracy and computational time demonstrate that our algorithm outperforms several commonly-used heuristic algorithms. Moreover, compared to the exhaustive enumeration benchmark, our algorithm sacrifices only 0.22% of solution accuracy while saving 55.26% of CPU time in the tested network. In particular, in Munich, affected passengers are roughly evenly divided between adapting by adjusting their travel paths and switching to alternative shared-corridor services. In contrast, in Beijing’s grid network, passengers can only detour their travel paths due to the lack of substitute services. These findings highlight that while short-turning operations facilitate faster transfers and reduce overall travel time, the impacts of short turnings on travel efficiency strongly depend on the underlying network structure. In conclusion, integration of short-turning and timetabling can effectively improve first train coordination in subway networks.</div></div>","PeriodicalId":49421,"journal":{"name":"Transportation Research Part A-Policy and Practice","volume":"205 ","pages":"Article 104851"},"PeriodicalIF":7.2000,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part A-Policy and Practice","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0965856425004847","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/1/6 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

Abstract

Ensuring connectivity in extended and continuously growing subway networks during the early morning start-up period becomes more and more challenging due to the limited number of trains and increasing infrastructure restrictions. In the present paper, train coordination strategies to maximize the connectivity of all origin-destination (OD) pairs and their effectiveness are investigated. An integrated mixed-integer nonlinear programming model is developed to simultaneously optimize short-turning plans and first train timetables. The model takes into account travel path choices between OD pairs and the impact of short-turning trains on ride plans. As the number of potential short-turning plans grows exponentially, computing an optimal solution incorporating all possible timetable schemes will be nearly impossible. As a result, a hierarchical two-stage optimization framework is developed to improve train short-turning and timetable coordination, which combines a breadth-first branch-and-cut algorithm for generating short-turning plans with a customized column generation algorithm for determining optimal train timetable coordination. To investigate the influence of network structure on coordination, we conducted two case studies with distinct network characteristics: Munich (shared-corridor network) and Beijing (grid network). The experimental results show that the proposed short-turning strategy effectively improves operational efficiency in both networks. Furthermore, comprehensive comparisons of solution accuracy and computational time demonstrate that our algorithm outperforms several commonly-used heuristic algorithms. Moreover, compared to the exhaustive enumeration benchmark, our algorithm sacrifices only 0.22% of solution accuracy while saving 55.26% of CPU time in the tested network. In particular, in Munich, affected passengers are roughly evenly divided between adapting by adjusting their travel paths and switching to alternative shared-corridor services. In contrast, in Beijing’s grid network, passengers can only detour their travel paths due to the lack of substitute services. These findings highlight that while short-turning operations facilitate faster transfers and reduce overall travel time, the impacts of short turnings on travel efficiency strongly depend on the underlying network structure. In conclusion, integration of short-turning and timetabling can effectively improve first train coordination in subway networks.
将短转弯策略融入地铁首列协调调度
由于列车数量有限和基础设施限制的增加,确保在清晨启动期间延长和不断增长的地铁网络的连通性变得越来越具有挑战性。本文研究了列车协调策略,以最大限度地提高所有始发目的地对的连通性,并对其有效性进行了研究。建立了一种综合的混合整数非线性规划模型,用于同时优化短转弯计划和首列列车时刻表。该模型考虑了OD对之间的出行路径选择以及短转弯列车对出行计划的影响。由于潜在的短转弯计划的数量呈指数级增长,计算一个包含所有可能时间表方案的最优解决方案几乎是不可能的。在此基础上,提出了一种两阶段分层优化框架,该框架将宽度优先的分切算法与确定最优列车时刻表协调的自定义列生成算法相结合,以改善列车短曲和列车时刻表协调。为了研究网络结构对协同的影响,我们以慕尼黑(共享廊道网络)和北京(网格网络)两个具有不同网络特征的案例为研究对象。实验结果表明,所提出的短转弯策略有效地提高了两个网络的运行效率。此外,对求解精度和计算时间的综合比较表明,我们的算法优于几种常用的启发式算法。此外,与穷举枚举基准相比,我们的算法在测试网络中仅牺牲了0.22%的解精度,而节省了55.26%的CPU时间。特别是在慕尼黑,受影响的乘客大致分为两类,一类是通过调整出行路径来适应,另一类是转向其他共享走廊服务。相比之下,在北京的铁路网中,由于缺乏替代服务,乘客只能绕道而行。这些发现强调,虽然短转弯操作有助于更快的转移和减少总体旅行时间,但短转弯对旅行效率的影响很大程度上取决于潜在的网络结构。综上所述,将短转弯与调度相结合可以有效改善地铁网络的首列协调。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
13.20
自引率
7.80%
发文量
257
审稿时长
9.8 months
期刊介绍: Transportation Research: Part A contains papers of general interest in all passenger and freight transportation modes: policy analysis, formulation and evaluation; planning; interaction with the political, socioeconomic and physical environment; design, management and evaluation of transportation systems. Topics are approached from any discipline or perspective: economics, engineering, sociology, psychology, etc. Case studies, survey and expository papers are included, as are articles which contribute to unification of the field, or to an understanding of the comparative aspects of different systems. Papers which assess the scope for technological innovation within a social or political framework are also published. The journal is international, and places equal emphasis on the problems of industrialized and non-industrialized regions. Part A''s aims and scope are complementary to Transportation Research Part B: Methodological, Part C: Emerging Technologies and Part D: Transport and Environment. Part E: Logistics and Transportation Review. Part F: Traffic Psychology and Behaviour. The complete set forms the most cohesive and comprehensive reference of current research in transportation science.
×
引用
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学术官方微信
小红书