超饱和地铁线路高峰时段滞留管理的预约策略建模

IF 7.6 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY
{"title":"超饱和地铁线路高峰时段滞留管理的预约策略建模","authors":"","doi":"10.1016/j.trc.2024.104819","DOIUrl":null,"url":null,"abstract":"<div><p>Metro is the main travel model for urban commuters in many metropolises around the world. During peak hours, large numbers of passengers pour into metro stations for rail services, but some are unable to board the trains in time and left stranded on the platform or even queuing outside the stations. The trip reservation (TR) strategy, where passengers preplan their trips and reserve their entry time to the stations. This paper develops an entry reservation strategy (ERS) to optimize the commuter flow during peak hours, and construct a multi-objective passenger flow joint optimization model based on many-to-many passenger demand to minimize the total trip cost of passengers at reservation station and the number of stranded passengers at intermediate stations. The passenger flow optimization problem is formulated as a mixed-integer non-linear programming (MINLP) model. We design an iterative sequential search algorithm combined with the GUROBI solver to obtain the parameters of the optimal ERS and the passenger flow distribution in the metro system after disaggregated reformulation of the complex constraints of the model. We also demonstrate the accuracy and effectiveness of the proposed method with two experiments – an illustrative example and a large-scale case study of Beijing Metro. The results of Beijing Metro experiment show that the joint optimization model with entry reservation strategy (JO-ERS) reduces the number of stranded passengers by 88.46 % compared with the original passenger flow from the AFC.</p></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":null,"pages":null},"PeriodicalIF":7.6000,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Modelling reservation strategies for managing peak-hour stranding on an oversaturated metro line\",\"authors\":\"\",\"doi\":\"10.1016/j.trc.2024.104819\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Metro is the main travel model for urban commuters in many metropolises around the world. During peak hours, large numbers of passengers pour into metro stations for rail services, but some are unable to board the trains in time and left stranded on the platform or even queuing outside the stations. The trip reservation (TR) strategy, where passengers preplan their trips and reserve their entry time to the stations. This paper develops an entry reservation strategy (ERS) to optimize the commuter flow during peak hours, and construct a multi-objective passenger flow joint optimization model based on many-to-many passenger demand to minimize the total trip cost of passengers at reservation station and the number of stranded passengers at intermediate stations. The passenger flow optimization problem is formulated as a mixed-integer non-linear programming (MINLP) model. We design an iterative sequential search algorithm combined with the GUROBI solver to obtain the parameters of the optimal ERS and the passenger flow distribution in the metro system after disaggregated reformulation of the complex constraints of the model. We also demonstrate the accuracy and effectiveness of the proposed method with two experiments – an illustrative example and a large-scale case study of Beijing Metro. The results of Beijing Metro experiment show that the joint optimization model with entry reservation strategy (JO-ERS) reduces the number of stranded passengers by 88.46 % compared with the original passenger flow from the AFC.</p></div>\",\"PeriodicalId\":54417,\"journal\":{\"name\":\"Transportation Research Part C-Emerging Technologies\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.6000,\"publicationDate\":\"2024-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part C-Emerging Technologies\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0968090X24003401\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"TRANSPORTATION SCIENCE & TECHNOLOGY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part C-Emerging Technologies","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0968090X24003401","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TRANSPORTATION SCIENCE & TECHNOLOGY","Score":null,"Total":0}
引用次数: 0

摘要

在世界许多大都市,地铁是城市通勤者的主要出行方式。在高峰时段,大量乘客涌入地铁站乘车,但有些乘客无法及时上车,滞留在站台上,甚至在站外排队等候。乘客通过行程预约(TR)策略,预先规划行程,预约进站时间。本文开发了一种进站预约策略(ERS)来优化高峰时段的通勤客流,并构建了一个基于多对多客流需求的多目标客流联合优化模型,以最小化乘客在预约站的总出行成本和在中间站的滞留乘客数量。客流优化问题被表述为一个混合整数非线性编程(MINLP)模型。我们设计了一种结合 GUROBI 求解器的迭代顺序搜索算法,在对模型的复杂约束条件进行分解重构后,可获得最优 ERS 的参数和地铁系统的客流分布。我们还通过两个实验--示例和北京地铁的大规模案例研究--证明了所提方法的准确性和有效性。北京地铁的实验结果表明,采用入口预约策略的联合优化模型(JO-ERS)与来自 AFC 的原始客流相比,滞留乘客数量减少了 88.46%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Modelling reservation strategies for managing peak-hour stranding on an oversaturated metro line

Metro is the main travel model for urban commuters in many metropolises around the world. During peak hours, large numbers of passengers pour into metro stations for rail services, but some are unable to board the trains in time and left stranded on the platform or even queuing outside the stations. The trip reservation (TR) strategy, where passengers preplan their trips and reserve their entry time to the stations. This paper develops an entry reservation strategy (ERS) to optimize the commuter flow during peak hours, and construct a multi-objective passenger flow joint optimization model based on many-to-many passenger demand to minimize the total trip cost of passengers at reservation station and the number of stranded passengers at intermediate stations. The passenger flow optimization problem is formulated as a mixed-integer non-linear programming (MINLP) model. We design an iterative sequential search algorithm combined with the GUROBI solver to obtain the parameters of the optimal ERS and the passenger flow distribution in the metro system after disaggregated reformulation of the complex constraints of the model. We also demonstrate the accuracy and effectiveness of the proposed method with two experiments – an illustrative example and a large-scale case study of Beijing Metro. The results of Beijing Metro experiment show that the joint optimization model with entry reservation strategy (JO-ERS) reduces the number of stranded passengers by 88.46 % compared with the original passenger flow from the AFC.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
15.80
自引率
12.00%
发文量
332
审稿时长
64 days
期刊介绍: Transportation Research: Part C (TR_C) is dedicated to showcasing high-quality, scholarly research that delves into the development, applications, and implications of transportation systems and emerging technologies. Our focus lies not solely on individual technologies, but rather on their broader implications for the planning, design, operation, control, maintenance, and rehabilitation of transportation systems, services, and components. In essence, the intellectual core of the journal revolves around the transportation aspect rather than the technology itself. We actively encourage the integration of quantitative methods from diverse fields such as operations research, control systems, complex networks, computer science, and artificial intelligence. Join us in exploring the intersection of transportation systems and emerging technologies to drive innovation and progress in the field.
×
引用
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学术官方微信