PROTRIP: Probabilistic Risk-Aware Optimal Transit Planner.

Pranay Thangeda, Melkior Ornik
{"title":"PROTRIP: Probabilistic Risk-Aware Optimal Transit Planner.","authors":"Pranay Thangeda, Melkior Ornik","doi":"10.1109/itsc45102.2020.9294500","DOIUrl":null,"url":null,"abstract":"<p><p>Optimal routing in urban transit networks, where variable congestion levels often lead to stochastic travel times, is usually studied with the least expected travel time (LET) as the performance criteria under the assumption of travel time independence on different road segments. However, a LET path might be subjected to high variability of travel time and therefore might not be desirable to transit users seeking a predictable arrival time. Further, there exists a spatial correlation in urban travel times due to the cascading effect of congestion across the road network. In this work, we propose a methodology and a tool that, given an origin-destination pair, a travel time budget, and a measure of the passenger's tolerance for uncertainty, provide the optimal online route choice in a transit network by balancing the objectives of maximizing on-time arrival probability and minimizing expected travel time. Our framework takes into account the correlation between travel time of different edges along a route and updates downstream distributions by taking advantage of upstream real-time information. We demonstrate the utility and performance of our algorithm with the help of realistic numerical experiments conducted on a fixed-route bus system that serves the residents of the Champaign-Urbana metropolitan area.</p>","PeriodicalId":93224,"journal":{"name":"Proceedings. IEEE Conference on Intelligent Transportation Systems","volume":"2020 ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7840083/pdf/nihms-1609578.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE Conference on Intelligent Transportation Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/itsc45102.2020.9294500","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Optimal routing in urban transit networks, where variable congestion levels often lead to stochastic travel times, is usually studied with the least expected travel time (LET) as the performance criteria under the assumption of travel time independence on different road segments. However, a LET path might be subjected to high variability of travel time and therefore might not be desirable to transit users seeking a predictable arrival time. Further, there exists a spatial correlation in urban travel times due to the cascading effect of congestion across the road network. In this work, we propose a methodology and a tool that, given an origin-destination pair, a travel time budget, and a measure of the passenger's tolerance for uncertainty, provide the optimal online route choice in a transit network by balancing the objectives of maximizing on-time arrival probability and minimizing expected travel time. Our framework takes into account the correlation between travel time of different edges along a route and updates downstream distributions by taking advantage of upstream real-time information. We demonstrate the utility and performance of our algorithm with the help of realistic numerical experiments conducted on a fixed-route bus system that serves the residents of the Champaign-Urbana metropolitan area.

概率风险感知最优交通规划。
城市交通网络的最优路径通常以最小期望出行时间(LET)为性能准则,在不同路段的出行时间无关的前提下进行研究,其中拥堵程度的变化往往导致出行时间的随机化。然而,LET路径可能会受到旅行时间的高度可变性的影响,因此对于寻求可预测到达时间的过境用户来说可能不可取。此外,由于整个路网的拥堵级联效应,城市出行时间存在空间相关性。在这项工作中,我们提出了一种方法和工具,在给定出发地对、旅行时间预算和乘客对不确定性的容忍度的情况下,通过平衡最大化准时到达概率和最小化预期旅行时间的目标,提供交通网络中最优的在线路线选择。我们的框架考虑了沿路线不同边的行驶时间之间的相关性,并利用上游的实时信息更新下游分布。我们通过在为香槟-厄巴纳大都会区居民服务的固定路线公交系统上进行的实际数值实验来证明该算法的实用性和性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信