...
首页> 外文期刊>The VLDB journal >Risk-aware path selection with time-varying, uncertain travel costs: a time series approach
【24h】

Risk-aware path selection with time-varying, uncertain travel costs: a time series approach

机译:具有时变,不确定旅行成本的风险感知路径选择:时间序列方法

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

We address the problem of choosing the best paths among a set of candidate paths between the same origin-destination pair. This functionality is used extensively when constructing origin-destination matrices in logistics and flex transportation. Because the cost of a path, e.g., travel time, varies over time and is uncertain, there is generally no single best path. We partition time into intervals and represent the cost of a path during an interval as a random variable, resulting in an uncertain time series for each path. When facing uncertainties, users generally have different risk preferences, e.g., risk-loving or risk-averse, and thus prefer different paths. We develop techniques that, for each time interval, are able to find paths with non-dominated lowest costs while taking the users' risk preferences into account. We represent risk by means of utility function categories and show how the use of first-order and two kinds of second-order stochastic dominance relationships among random variables makes it possible to find all paths with non-dominated lowest costs. We report on empirical studies with large uncertain time series collections derived from a 2-year GPS data set. The study offers insight into the performance of the proposed techniques, and it indicates that the best techniques combine to offer an efficient and robust solution.
机译:我们解决了在同一起点-终点对之间的一组候选路径中选择最佳路径的问题。在物流和弹性运输中构造起点-目的地矩阵时,将广泛使用此功能。由于路径的成本(例如旅行时间)会随时间变化并且不确定,因此通常没有一条最佳路径。我们将时间划分为多个间隔,并将间隔内路径的成本表示为随机变量,从而导致每个路径的时间序列不确定。当面对不确定性时,用户通常具有不同的风险偏好,例如爱好风险或规避风险,因此偏好不同的路径。我们开发的技术可以在每个时间间隔内,以最低的非成本成本找到路径,同时考虑用户的风险偏好。我们通过效用函数类别来表示风险,并展示如何通过使用随机变量之间的一阶和两种二阶随机优势关系来查找所有非支配的最低成本路径。我们报告了来自2年GPS数据集的大量不确定的时间序列集合的实证研究。该研究提供了对所提议技术的性能的洞察力,它表明最好的技术结合起来可以提供一种有效而强大的解决方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号