Exploring the intra-platoon planning problem for heterogeneous train traffic under virtual coupling in the railway network via simulation

IF 2.6 Q3 TRANSPORTATION
Jiamin Zhang
{"title":"Exploring the intra-platoon planning problem for heterogeneous train traffic under virtual coupling in the railway network via simulation","authors":"Jiamin Zhang","doi":"10.1016/j.jrtpm.2024.100442","DOIUrl":null,"url":null,"abstract":"<div><p>Study on the platoon planning of virtual coupling (VC) is indispensable for both passenger and freight railway operation in terms of capacity, scheduling, and timetabling. As an advanced technology in train operation and control systems, VC can significantly improve the performance of rail operations, with regards to capacity, flexibility and robustness. In this study, we mainly focus on the former one, i.e., to maximize the capacity gains, by employing the relative braking distance based spacing policy for heterogenous train traffic. To our knowledge, this article is the first to address the VC intra-platoon planning problem for a railway network. The main function/purpose of this study is to decide a leader train and allocate an order to the heterogeneous follower trains for the virtually coupled platoon in the off-line mode. The objective is transformed to minimize and compare the sum of minimum safe distance for platoons on the common shared route sections in the railway network from various perspectives, so as to seek the desirable orders of potential train consists within the platoons from the perspective of the whole railway network. Our contributions are mainly threefold. First, the conditions for train platooning under virtual coupling are synthesized. Second, the solution flow charts and algorithms for simulation are proposed, including general framework for simulation, classification of prioritizing the shared common route section, and flow charts and algorithms for decision of coupling order to train platoons. Finally, the proposed methodology was tested and discussed on the designed computational experiment (i.e., numerical simulations of a typical case study with two sets of test examples) via NetLogo platform. The numerical simulation results series revealed some key findings and validated the effectiveness of the proposed methodology. Results of this study can provide guidance to decision makers in timetabling and potential capacity bottleneck identification under VC. We believe that it is worth investigating and further advancing this research direction in the future.</p></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"30 ","pages":"Article 100442"},"PeriodicalIF":2.6000,"publicationDate":"2024-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S221097062400012X/pdfft?md5=b3a357ffda94d0c9b4ddee02439d29f1&pid=1-s2.0-S221097062400012X-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Rail Transport Planning & Management","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S221097062400012X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TRANSPORTATION","Score":null,"Total":0}
引用次数: 0

Abstract

Study on the platoon planning of virtual coupling (VC) is indispensable for both passenger and freight railway operation in terms of capacity, scheduling, and timetabling. As an advanced technology in train operation and control systems, VC can significantly improve the performance of rail operations, with regards to capacity, flexibility and robustness. In this study, we mainly focus on the former one, i.e., to maximize the capacity gains, by employing the relative braking distance based spacing policy for heterogenous train traffic. To our knowledge, this article is the first to address the VC intra-platoon planning problem for a railway network. The main function/purpose of this study is to decide a leader train and allocate an order to the heterogeneous follower trains for the virtually coupled platoon in the off-line mode. The objective is transformed to minimize and compare the sum of minimum safe distance for platoons on the common shared route sections in the railway network from various perspectives, so as to seek the desirable orders of potential train consists within the platoons from the perspective of the whole railway network. Our contributions are mainly threefold. First, the conditions for train platooning under virtual coupling are synthesized. Second, the solution flow charts and algorithms for simulation are proposed, including general framework for simulation, classification of prioritizing the shared common route section, and flow charts and algorithms for decision of coupling order to train platoons. Finally, the proposed methodology was tested and discussed on the designed computational experiment (i.e., numerical simulations of a typical case study with two sets of test examples) via NetLogo platform. The numerical simulation results series revealed some key findings and validated the effectiveness of the proposed methodology. Results of this study can provide guidance to decision makers in timetabling and potential capacity bottleneck identification under VC. We believe that it is worth investigating and further advancing this research direction in the future.

通过仿真探索铁路网虚拟耦合下异构列车交通的队内规划问题
虚拟耦合(VC)的排计划研究对于客运和货运铁路运营的运力、调度和时刻表编制都是不可或缺的。作为列车运行和控制系统中的一项先进技术,虚拟耦合可在运能、灵活性和稳健性方面显著提高铁路运行性能。在本研究中,我们主要关注前者,即通过采用基于相对制动距离的异质列车运行间隔策略,最大限度地提高运力收益。据我们所知,这篇文章是第一篇解决铁路网络中 VC 排内规划问题的文章。本研究的主要功能/目的是为离线模式下的虚拟耦合排决定领队列车并为异构跟车列车分配订单。研究的目标转变为从不同角度最小化和比较铁路网中共用线路段上各排列车的最小安全距离之和,从而从整个铁路网的角度寻求排内潜在列车编组的理想顺序。我们的贡献主要体现在三个方面。首先,归纳了虚拟耦合下列车编组的条件。其次,提出了仿真的解决方案流程图和算法,包括仿真的总体框架、共享共用线路段优先级的分类,以及决定列车编组耦合顺序的流程图和算法。最后,通过 NetLogo 平台对所设计的计算实验(即用两组测试实例对典型案例研究进行数值模拟)对所提出的方法进行了测试和讨论。数值模拟结果系列揭示了一些关键发现,验证了所提方法的有效性。本研究的结果可为决策者提供指导,帮助他们制定时间安排和识别 VC 下潜在的容量瓶颈。我们认为,这一研究方向值得在未来进一步研究和推进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
7.10
自引率
8.10%
发文量
41
×
引用
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学术官方微信