Optimizing and synchronizing timetable in an urban subway network with stop-skip strategy

Homa Motvallian Naeini, Yousef Shafahi, Mohammad SafariTaherkhani
{"title":"Optimizing and synchronizing timetable in an urban subway network with stop-skip strategy","authors":"Homa Motvallian Naeini,&nbsp;Yousef Shafahi,&nbsp;Mohammad SafariTaherkhani","doi":"10.1016/j.jrtpm.2022.100301","DOIUrl":null,"url":null,"abstract":"<div><p><span>Stop-skipping and timetable synchronization are two effective strategies to reduce total passengers’ travel time in a transit network for </span>subway<span> operation. However, the majority of studies conducted on the topic do not consider stop-skipping strategy and timetable synchronization simultaneously. Thus, this article proposes a mixed-integer programming model considering both strategies simultaneously. The model is based on passenger smart-card data concerning the trains’ capacity to minimize total passengers’ waiting time and in-vehicle time and maximize the number of passengers who successfully reach their destination in a specific study horizon. Since increasing the number of trains, stations, or the study horizon, exponentially increases the size of the problem, seeking efficient methods to solve real-sized problems is inevitable. Therefore, a heuristic algorithm based<span> on a genetic algorithm (GA) was developed to solve the model. A hypothetical example was solved with GAMS (CPLEX) in order to evaluate the performance of both the model and the used algorithm. Then, the results were compared with the results of GA. Finally, a large-scale, real-life case study based on Tehran rail transit network was used to evaluate the proposed models in this study and the genetic algorithm approach. The results indicated that the proposed model reduced each passenger’s travel time by approximately 4.78%, on average, and it also reduced each passenger’s transfer waiting time by approximately 32.4%, on average in a peak hour. Finally, it maximized the number of passengers who reached their destination successfully in the considered study horizon.</span></span></p></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"22 ","pages":"Article 100301"},"PeriodicalIF":2.6000,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Rail Transport Planning & Management","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210970622000051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TRANSPORTATION","Score":null,"Total":0}
引用次数: 5

Abstract

Stop-skipping and timetable synchronization are two effective strategies to reduce total passengers’ travel time in a transit network for subway operation. However, the majority of studies conducted on the topic do not consider stop-skipping strategy and timetable synchronization simultaneously. Thus, this article proposes a mixed-integer programming model considering both strategies simultaneously. The model is based on passenger smart-card data concerning the trains’ capacity to minimize total passengers’ waiting time and in-vehicle time and maximize the number of passengers who successfully reach their destination in a specific study horizon. Since increasing the number of trains, stations, or the study horizon, exponentially increases the size of the problem, seeking efficient methods to solve real-sized problems is inevitable. Therefore, a heuristic algorithm based on a genetic algorithm (GA) was developed to solve the model. A hypothetical example was solved with GAMS (CPLEX) in order to evaluate the performance of both the model and the used algorithm. Then, the results were compared with the results of GA. Finally, a large-scale, real-life case study based on Tehran rail transit network was used to evaluate the proposed models in this study and the genetic algorithm approach. The results indicated that the proposed model reduced each passenger’s travel time by approximately 4.78%, on average, and it also reduced each passenger’s transfer waiting time by approximately 32.4%, on average in a peak hour. Finally, it maximized the number of passengers who reached their destination successfully in the considered study horizon.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于停跳策略的城市地铁网络时刻表优化与同步
在地铁运营的交通网络中,跳站和时刻表同步是减少乘客总出行时间的两种有效策略。然而,大多数关于该主题的研究并没有同时考虑跳停策略和时间表同步。因此,本文提出了一种同时考虑两种策略的混合整数规划模型。该模型基于乘客智能卡数据,该数据涉及列车的容量,以最小化总乘客等待时间和车内时间,并在特定的研究范围内最大化成功到达目的地的乘客数量。由于列车、车站或研究范围的增加,问题的规模会呈指数级增长,因此寻求有效的方法来解决实际规模的问题是不可避免的。为此,提出了一种基于遗传算法的启发式算法来求解该模型。用GAMS (CPLEX)对一个假设的例子进行了求解,以评估模型和算法的性能。然后,将结果与遗传算法的结果进行比较。最后,以德黑兰轨道交通网络为例,对本文提出的模型和遗传算法方法进行了评估。结果表明,在高峰时段,该模型使每位乘客的出行时间平均减少约4.78%,使每位乘客的换乘等待时间平均减少约32.4%。最后,在考虑的研究范围内,使成功到达目的地的乘客数量最大化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
7.10
自引率
8.10%
发文量
41
期刊最新文献
A MILP model to improve the robustness of a railway timetable by retiming and rerouting in a complex bottleneck area A decomposition approach to solve the individual railway crew Re-planning problem A Bi-objective model and a branch-and-price-and-cut solution method for the railroad blocking problem in hazardous material transportation Relationships between service quality and customer satisfaction in rail freight transportation: A structural equation modeling approach The evaluation of competition effect on rail fares using the difference-in-difference method through symmetric and lagged spans
×
引用
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