...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Transportation Research Part B: Methodological >Algorithms for most reliable routes on stochastic and time-dependent networks
【24h】

Algorithms for most reliable routes on stochastic and time-dependent networks

机译：随机和时间依赖网络上最可靠路由的算法

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

摘要

This study presents algorithms to determine the most reliable routes on stochastic and time-dependent networks. The measure of reliability adopted is the probability of on-time arrival at the destination, given a threshold arrival-time. We propose two distinct algorithms to determine optimal time-adaptive strategy and optimal apriori path on stochastic and time-dependent networks. First, a decreasing order-of-time algorithm is proposed to determine the optimal strategy to the sink from all node and departure-time combinations. Second, a label-correcting, network pruning algorithm is proposed to determine the optimal path between the source and the sink for a given departure-time. The correctness of both the proposed algorithms is proved and their computational complexity expressions are derived. The efficacy of the proposed procedures is demonstrated on large-scale transportation networks. This work has the potential to facilitate wider application of stochastic and time-dependent networks in reliability-based modeling and analysis. (C) 2020 Elsevier Ltd. All rights reserved.
机译：本研究介绍了确定随机和时间依赖网络上最可靠的路线的算法。采用可靠性的衡量标准是当阈值到达时，目的地准时到达的可能性。我们提出了两个不同的算法来确定随机和时间依赖网络上的最佳时间 - 自适应策略和最佳的Apriori路径。首先，提出了一种减少令的时间估算，以确定来自所有节点和出发时间组合的宿宿者的最佳策略。其次，提出了一种标签校正，网络修剪算法以确定给定的出发时间的源和接收器之间的最佳路径。证明了所提出的算法的正确性，并导出其计算复杂性表达式。提出的程序的功效在大规模的运输网络上证明。这项工作具有促进在基于可靠性的建模和分析中的随机和时间依赖网络的更广泛应用。 （c）2020 elestvier有限公司保留所有权利。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号