This paper conducted a theoretical study on finding optimalpaths in stochastic time-dependent (std) transportation networks. A stochastic consistent network with std link travel times was built. The methodology of ro...
详细信息
ISBN:
(纸本)9781479960798
This paper conducted a theoretical study on finding optimalpaths in stochastic time-dependent (std) transportation networks. A stochastic consistent network with std link travel times was built. The methodology of robust optimization was applied to evaluate the paths for a priori optimization without requiring the probability distribution of travel times. The paths with greatest robustness, namely minimum upper bounds of travel times were defined as the optimalpath. Under the stochastic consistent condition, the stdrobustoptimalpath model can be converted into solving a time-dependent shortest pathproblem in a FIFO network. Then extended Dijkstra's algorithm can be applied to solve the simplified stdproblem with computation complexity O (n~2). In the field experiment, several tests were conducted on finding robustoptimalpaths in a sampled std transportation network of Shanghai, China. The numerical results confirmed the validity of the proposed approach and verified that the natural extension of conventional Dijkstra's algorithm can solve the std robust optimal path problem as efficiently as a static network problem.
暂无评论