带有乘客路线的铁路线路规划:直接服务网络表示法和两阶段解决方法

IF 5.8 1区 工程技术 Q1 ECONOMICS Transportation Research Part B-Methodological Pub Date : 2024-06-13 DOI:10.1016/j.trb.2024.102989
Zhiyuan Yao, Lei Nie, Huiling Fu
{"title":"带有乘客路线的铁路线路规划:直接服务网络表示法和两阶段解决方法","authors":"Zhiyuan Yao,&nbsp;Lei Nie,&nbsp;Huiling Fu","doi":"10.1016/j.trb.2024.102989","DOIUrl":null,"url":null,"abstract":"<div><p>The railway line planning problem (LPP) plays a crucial role in determining the quality of services provided to passengers, as well as operation costs borne by railway companies. In periodic railway LPPs, it is common to consider passenger transfers between train lines to realize a general passenger travel cost setting in the railway system. While detecting passenger transfers requires incorporating passenger routing into mathematical formulations, thereby significantly complicating the problem. Studies on transfer-included LPPs are generally based on the Change&amp;Go network that is constructed based on a pre-given line pool, which however is usually non-exhaustive due to computational intractability. To efficiently include passenger transfers in large-scale railway LPPs, this paper proposes a novel extended direct-service network representation of LPP, where lines are dynamically generated within the optimization process, and part of passenger transfers between lines can be precisely captured without the need for explicit modeling of passengers’ distribution on specific lines. A two-phase solution approach based on the representation is designed. The first phase formulates LPP with part of transfers as a path-based service network design model, solved using a branch-price-and-cut algorithm. The second phase conducts a neighborhood search around the first-phase solution to seek better ones when considering all passenger transfers. Numerical results showcase the good performance of the two-phase solution approach. It delivers optimal solutions in 18 out of 24 test instances for a small case and achieves optimality gaps within 2.85% across all small instances. The large case study of China’s Shandong high-speed railway network whose line pool size reaches millions demonstrates the scalability of the approach and its advantage over the traditional Change&amp;Go method with partial line pools and an exact model developed in the paper.</p></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"186 ","pages":"Article 102989"},"PeriodicalIF":5.8000,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Railway line planning with passenger routing: Direct-service network representations and a two-phase solution approach\",\"authors\":\"Zhiyuan Yao,&nbsp;Lei Nie,&nbsp;Huiling Fu\",\"doi\":\"10.1016/j.trb.2024.102989\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The railway line planning problem (LPP) plays a crucial role in determining the quality of services provided to passengers, as well as operation costs borne by railway companies. In periodic railway LPPs, it is common to consider passenger transfers between train lines to realize a general passenger travel cost setting in the railway system. While detecting passenger transfers requires incorporating passenger routing into mathematical formulations, thereby significantly complicating the problem. Studies on transfer-included LPPs are generally based on the Change&amp;Go network that is constructed based on a pre-given line pool, which however is usually non-exhaustive due to computational intractability. To efficiently include passenger transfers in large-scale railway LPPs, this paper proposes a novel extended direct-service network representation of LPP, where lines are dynamically generated within the optimization process, and part of passenger transfers between lines can be precisely captured without the need for explicit modeling of passengers’ distribution on specific lines. A two-phase solution approach based on the representation is designed. The first phase formulates LPP with part of transfers as a path-based service network design model, solved using a branch-price-and-cut algorithm. The second phase conducts a neighborhood search around the first-phase solution to seek better ones when considering all passenger transfers. Numerical results showcase the good performance of the two-phase solution approach. It delivers optimal solutions in 18 out of 24 test instances for a small case and achieves optimality gaps within 2.85% across all small instances. The large case study of China’s Shandong high-speed railway network whose line pool size reaches millions demonstrates the scalability of the approach and its advantage over the traditional Change&amp;Go method with partial line pools and an exact model developed in the paper.</p></div>\",\"PeriodicalId\":54418,\"journal\":{\"name\":\"Transportation Research Part B-Methodological\",\"volume\":\"186 \",\"pages\":\"Article 102989\"},\"PeriodicalIF\":5.8000,\"publicationDate\":\"2024-06-13\",\"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/S0191261524001139\",\"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/S0191261524001139","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

摘要

铁路线路规划问题(LPP)在决定为乘客提供的服务质量以及铁路公司承担的运营成本方面起着至关重要的作用。在定期铁路线路规划问题中,通常会考虑列车线路之间的乘客换乘,以实现铁路系统中的一般乘客旅行成本设定。而检测乘客换乘需要将乘客路线纳入数学公式,从而大大增加了问题的复杂性。关于包含换乘的 LPP 的研究一般基于 Change&Go 网络,该网络是根据预先给定的线路池构建的,但由于计算上的不可操作性,该网络通常并不详尽。为了在大规模铁路 LPP 中有效地包含乘客换乘,本文提出了一种新颖的 LPP 扩展直接服务网络表示法,即在优化过程中动态生成线路,并精确捕捉线路间的部分乘客换乘,而无需明确模拟乘客在具体线路上的分布。设计了一种基于该表示法的两阶段求解方法。第一阶段将带有部分换乘的 LPP 表述为基于路径的服务网络设计模型,使用分支-价格-切割算法求解。第二阶段围绕第一阶段的解决方案进行邻域搜索,以寻求在考虑所有乘客换乘时更好的解决方案。数值结果展示了两阶段求解方法的良好性能。在一个小型案例的 24 个测试实例中,它在 18 个实例中提供了最优解,并在所有小型实例中实现了 2.85% 的最优差距。中国山东高速铁路网的线路池规模高达数百万,该大型案例研究证明了该方法的可扩展性,以及与传统的部分线路池 Change&Go 方法和本文开发的精确模型相比的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Railway line planning with passenger routing: Direct-service network representations and a two-phase solution approach

The railway line planning problem (LPP) plays a crucial role in determining the quality of services provided to passengers, as well as operation costs borne by railway companies. In periodic railway LPPs, it is common to consider passenger transfers between train lines to realize a general passenger travel cost setting in the railway system. While detecting passenger transfers requires incorporating passenger routing into mathematical formulations, thereby significantly complicating the problem. Studies on transfer-included LPPs are generally based on the Change&Go network that is constructed based on a pre-given line pool, which however is usually non-exhaustive due to computational intractability. To efficiently include passenger transfers in large-scale railway LPPs, this paper proposes a novel extended direct-service network representation of LPP, where lines are dynamically generated within the optimization process, and part of passenger transfers between lines can be precisely captured without the need for explicit modeling of passengers’ distribution on specific lines. A two-phase solution approach based on the representation is designed. The first phase formulates LPP with part of transfers as a path-based service network design model, solved using a branch-price-and-cut algorithm. The second phase conducts a neighborhood search around the first-phase solution to seek better ones when considering all passenger transfers. Numerical results showcase the good performance of the two-phase solution approach. It delivers optimal solutions in 18 out of 24 test instances for a small case and achieves optimality gaps within 2.85% across all small instances. The large case study of China’s Shandong high-speed railway network whose line pool size reaches millions demonstrates the scalability of the approach and its advantage over the traditional Change&Go method with partial line pools and an exact model developed in the paper.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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