Data-based model of metro scheduling for passenger wait-time optimization with constraints: WIP abstract

Minji Kim, Hee-Jung Yoon, S. Son, Y. Eun
{"title":"Data-based model of metro scheduling for passenger wait-time optimization with constraints: WIP abstract","authors":"Minji Kim, Hee-Jung Yoon, S. Son, Y. Eun","doi":"10.1145/3302509.3313324","DOIUrl":null,"url":null,"abstract":"This paper presents a data-based model for metro scheduling that aims to minimizes passenger wait time under constraints. In contrast to existing approaches that rely on a statistical model of passenger arrival, we develop a model based on real-world automated fare collection (AFC) data in a metro line of a Korean city for an extended period of time. The model consists of decomposing the travel time for each passenger into wait, ride, and walk times, clustering of passengers by trains they ride and also calculating the number of passengers in each train for any given time. Based on this, for a given train schedule, the total wait time of all the passengers for the entire AFC data period can be calculated. Finally, the minimization problem is formulated using the model under realistic constraints. Refining and validating each component of the model are currently underway before we solve the minimization problem.","PeriodicalId":413733,"journal":{"name":"Proceedings of the 10th ACM/IEEE International Conference on Cyber-Physical Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 10th ACM/IEEE International Conference on Cyber-Physical Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3302509.3313324","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper presents a data-based model for metro scheduling that aims to minimizes passenger wait time under constraints. In contrast to existing approaches that rely on a statistical model of passenger arrival, we develop a model based on real-world automated fare collection (AFC) data in a metro line of a Korean city for an extended period of time. The model consists of decomposing the travel time for each passenger into wait, ride, and walk times, clustering of passengers by trains they ride and also calculating the number of passengers in each train for any given time. Based on this, for a given train schedule, the total wait time of all the passengers for the entire AFC data period can be calculated. Finally, the minimization problem is formulated using the model under realistic constraints. Refining and validating each component of the model are currently underway before we solve the minimization problem.
带约束的地铁乘客等待时间优化数据模型:WIP抽象
本文提出了一种基于数据的地铁调度模型,其目标是在约束条件下使乘客等待时间最小化。与现有的依赖于乘客到达统计模型的方法不同,我们开发了一个基于韩国城市地铁线路长时间的真实自动收费(AFC)数据的模型。该模型包括将每位乘客的出行时间分解为等待时间、乘车时间和步行时间,按他们乘坐的列车对乘客进行聚类,并计算任何给定时间内每列列车上的乘客人数。在此基础上,对于给定的列车时刻表,可以计算出整个AFC数据周期内所有乘客的总等待时间。最后,在实际约束条件下,利用该模型提出了最小化问题。在我们解决最小化问题之前,精炼和验证模型的每个组件目前正在进行中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信