...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Transportation Research Part B: Methodological >An online shortest path algorithm for reliable routing in schedule-based transit networks considering transfer failure probability
【24h】

An online shortest path algorithm for reliable routing in schedule-based transit networks considering transfer failure probability

机译：考虑转移故障概率的基于调度的公交网络中可靠路由的在线最短路径算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Most schedule-based transit assignment models assume deterministic vehicle arrival/departure times, in contrast to random vehicle arrival assumption in frequency-based models. This assumption simplifies user route choice behavior and fails to capture users' response to unreliable service. Moreover, the inherent inconvenience of transfers, primarily due to uncertain waiting time and failure probability, has always been a challenge in modeling transit networks, to the extent that determining an appropriate transfer penalty for heterogeneous user population is still a question when using planning models. This study aims to bridge the gap between frequency-based and schedule-based transit assignment models, and proposes a path algorithm in schedule-based transit networks with stochastic vehicle arrival times to model users' adaptive behavior in response to unreliable service. Path reliability is modeled by link failure probability, and an online shortest path algorithm is developed to find a routing policy with minimum expected travel time given preferred arrival time to destination. Complexity analyses and computational tests indicate that the model has potential for application in large-scale transit networks. Numerical tests verify that the model assigns passengers to more reliable paths with lower transfer rate without a need for a large transfer penalty. (C) 2019 Elsevier Ltd. All rights reserved.
机译：与基于频率的模型中的随机车辆到达假设相反，大多数基于时间表的运输分配模型均假设车辆到达/离开时间确定。该假设简化了用户路由选择行为，无法捕获用户对不可靠服务的响应。此外，主要由于不确定的等待时间和失败概率而引起的转移固有的不便一直是对运输网络进行建模的挑战，其程度在于，在使用规划模型时，确定针对异构用户群的适当转移惩罚仍然是一个问题。这项研究旨在弥合基于频率和基于时间表的公交分配模型之间的差距，并提出了一种基于时间表的公交网络中具有随机车辆到达时间的路径算法，以对用户响应不可靠服务的自适应行为进行建模。通过链路故障概率对路径可靠性进行建模，并开发了在线最短路径算法，以在给定到达目的地的首选到达时间的情况下，以最小的预期行进时间找到路由策略。复杂性分析和计算测试表明，该模型具有在大规模公交网络中应用的潜力。数值试验证明，该模型可将乘客分配到具有较低转移率的更可靠路径，而无需支付大额转移费用。 （C）2019 Elsevier Ltd.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号