Bicriterion shortest paths in stochastic time-dependent networks
Bicriterion shortest paths in stochastic time-dependent networks
复制标题
随机时间相关网络中的双准则最短路径
DOI：
--
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
K. A. Andersen
中科院分区：
文献类型：
--
作者：
L. Nielsen;D. Pretolani;K. A. Andersen
近年来，人们对使用随机时间依赖性（STD）网络作为建模工具的兴趣越来越大，用于在运输和电信等领域内的许多应用程序。众所周知，最佳路由策略不一定与路径相对应，而是与时间自适应策略相对应。但是，在某些应用程序中，要求路由策略应与网络中的无环路相对应，也就是说，时间自适应方面消失了，并且考虑了先验路线的选择。
In recent years there has been a growing interest in using stochastic time-dependent (STD) networks as a modelling tool for a number of applications within such areas as transportation and telecommunications. It is known that an optimal routing policy does not necessarily correspond to a path, but rather to a time-adaptive strategy. In some applications, however, it makes good sense to require that the routing policy should correspond to a loopless path in the network, that is, the time-adaptive aspect disappears and a priori route choice is considered.