中文摘要：

A theoretical study was conducted on finding optimal paths in transportation networks where link travel times were stochastic and time-dependent(STD). The methodology of relative robust optimization was applied as measures for comparing time-varying, random path travel times for a priori optimization. In accordance with the situation in real world, a stochastic consistent condition was provided for the STD networks and under this condition, a mathematical proof was given that the STD robust optimal path problem can be simplified into a minimum problem in specific time-dependent networks. A label setting algorithm was designed and tested to find travelers’ robust optimal path in a sampled STD network with computation complexity of O(n2+n·m). The validity of the robust approach and the designed algorithm were confirmed in the computational tests. Compared with conventional probability approach, the proposed approach is simple and efficient, and also has a good application prospect in navigation system.更多还原

英文摘要：

A theoretical study was conducted on finding optimal paths in transportation networks where link travel times were stochastic and time-dependent（STD）. The methodology of relative robust optimization was applied as measures for comparing time-varying, random path travel times for a priori optimization. In accordance with the situation in real world, a stochastic consistent condition was provided for the STD networks and under this condition, a mathematical proof was given that the STD robust optimal path problem can be simplified into a minimum problem in specific time-dependent networks. A label setting algorithm was designed and tested to find travelers＇ robust optimal path in a sampled STD network with computation complexity of O（n2＋n·m）. The validity of the robust approach and the designed algorithm were confirmed in the computational tests. Compared with conventional probability approach, the proposed approach is simple and efficient, and also has a good application prospect in navigation system.