Empirical research on robust optimal path problem in stochastic time-dependent networks

There are many uncertain factors affecting the service level of urban road network. The paper discusses the connecting route problem among urban areas. It proposes a robust optimization model taking the description of stochastic time-dependent network and selecting principles for robust paths into consideration. An advanced Dijkstra algorithm is put forward to solve the problem. Using Shenzhen GPS data, the paper establishes a stochastic time-dependent network, and studies the model and algorithm of the optimal robust path. The results indicate that the travel time varies from the different departure time, and the components of path are not the same, neither. At last, the result is compared with ones which are obtained by a normal algorithm based on time-dependent network. The comparison shows that the advanced algorithm is an effective method to apply into selecting robust route among urban areas.