Data-driven timetable design and passenger flow control optimization in metro lines

IF 7.6 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY Transportation Research Part C-Emerging Technologies Pub Date : 2024-07-25 DOI:10.1016/j.trc.2024.104761
{"title":"Data-driven timetable design and passenger flow control optimization in metro lines","authors":"","doi":"10.1016/j.trc.2024.104761","DOIUrl":null,"url":null,"abstract":"<div><p>As travel demands in metro systems continue to grow rapidly, the mismatch between passenger demand and metro capacity has become a critical challenge in metro operations. To address this issue, this paper investigates the collaborative optimization of train timetables and station-based passenger flow control under stochastic demand, which aims to minimize the total system cost while ensuring an adequate service level to each station. We formulate the research problem as a stochastic mixed-integer programming model with expected travel time cost constraints for each station and translate it into a multi-objective attainability problem by imposing a target on the objective value. We develop an efficient operation policy that determines the timetable and flow control decisions in response to each demand scenario, satisfying the objective and service level targets in the long term when feasible. We conduct extensive numerical experiments on both synthetic and real-world transit data to evaluate the performance of our approach. The results demonstrate that our approach outperforms the benchmark first-come-first-served policy in terms of efficiency and service fairness under both exogenous and endogenous demand distributions. The improvement achieved by our approach is attributed to the prioritization of short trips over long ones, effectively exploiting the reusable nature of train capacity.</p></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":null,"pages":null},"PeriodicalIF":7.6000,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0968090X24002821/pdfft?md5=628448b223f09cfc590d1d47e8df00e3&pid=1-s2.0-S0968090X24002821-main.pdf","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/S0968090X24002821","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TRANSPORTATION SCIENCE & TECHNOLOGY","Score":null,"Total":0}
引用次数: 0

Abstract

As travel demands in metro systems continue to grow rapidly, the mismatch between passenger demand and metro capacity has become a critical challenge in metro operations. To address this issue, this paper investigates the collaborative optimization of train timetables and station-based passenger flow control under stochastic demand, which aims to minimize the total system cost while ensuring an adequate service level to each station. We formulate the research problem as a stochastic mixed-integer programming model with expected travel time cost constraints for each station and translate it into a multi-objective attainability problem by imposing a target on the objective value. We develop an efficient operation policy that determines the timetable and flow control decisions in response to each demand scenario, satisfying the objective and service level targets in the long term when feasible. We conduct extensive numerical experiments on both synthetic and real-world transit data to evaluate the performance of our approach. The results demonstrate that our approach outperforms the benchmark first-come-first-served policy in terms of efficiency and service fairness under both exogenous and endogenous demand distributions. The improvement achieved by our approach is attributed to the prioritization of short trips over long ones, effectively exploiting the reusable nature of train capacity.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
数据驱动的地铁时刻表设计和客流控制优化
随着地铁系统出行需求的持续快速增长,乘客需求与地铁容量之间的不匹配已成为地铁运营中的一个关键挑战。为解决这一问题,本文研究了随机需求下列车时刻表和车站客流控制的协同优化问题,旨在最大限度地降低系统总成本,同时确保每个车站都有足够的服务水平。我们将研究问题表述为一个随机混合整数编程模型,其中包含每个车站的预期旅行时间成本约束,并通过对目标值施加一个目标,将其转化为一个多目标可实现性问题。我们开发了一种高效的运营策略,可根据每种需求情况确定时刻表和流量控制决策,在可行的情况下长期满足目标值和服务水平目标。我们在合成数据和真实公交数据上进行了大量数值实验,以评估我们方法的性能。结果表明,在外生性和内生性需求分布条件下,我们的方法在效率和服务公平性方面都优于基准的先到先得政策。我们的方法所取得的改进归功于短途出行优先于长途出行,有效地利用了列车运力的可重复使用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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.
期刊最新文献
A User-Driven Prioritisation Process implementation and optimisation for ATFM hotspot resolution Scenario-level knowledge transfer for motion planning of autonomous driving via successor representation Pricing for multi-modal pickup and delivery problems with heterogeneous users LFF: An attention allocation-based following behavior framework in lane-free environments T3C: A traffic-communication coupling control approach for autonomous intersection management system
×
引用
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