真实道路网络中随机最短路问题的场景构造
On scenario construction for stochastic shortest path problems in real road networks
摘要:
随机最短路径计算通常在非常严格的时间约束下执行,因此计算效率至关重要。CPU时间的一个主要决定因素是使用的场景数量。我们证明,通过仔细挑选合适的场景生成方法来寻找场景,对于给定数量的场景,计算的质量可以大大提高随机采样。我们研究了加州高速公路网络的一个真实案例,该网络有438条道路连接和24个5分钟的时间段,这意味着10,512个随机速度变量,在时间和空间上相关,导致总共55,245,816个不同的相关性。我们发现(1)场景生成方法生成无偏场景,并且在稳定性方面强于随机抽样(即,(2)为了达到一定的准确性,情景生成所需的情景数量远低于随机抽样,在稳定度为1%的情况下,情景生成所需的情景数量通常要少6-10倍;以及(3)不同的起点-目的地对和不同的目标函数可能需要不同数量的场景来实现指定的稳定性。
英文摘要:
Stochastic shortest path computations are often performed under very strict time constraints, so computational efficiency is critical. A major determinant for the CPU time is the number of scenarios used. We demonstrate that by carefully picking the right scenario generation method for finding scenarios, the quality of the computations can be improved substantially over random sampling for a given number of scenarios. We study a real case from a California freeway network with 438 road links and 24 5-minute time periods, implying 10,512 random speed variables, correlated in time and space, leading to a total of 55,245,816 distinct correlations. We find that (1) the scenario generation method generates unbiased scenarios and strongly outperforms random sampling in terms of stability (i.e., relative difference and variance) whichever origin-destination pair and objective function is used; (2) to achieve a certain accuracy, the number of scenarios required for scenario generation is much lower than that for random sampling, typically about 6-10 times lower for a stability level of 1\%; and (3) different origin-destination pairs and different objective functions could require different numbers of scenarios to achieve a specified stability.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。