Identification of critical links based on the optimal reliable path in stochastic traffic networks

In urban stochastic transportation networks, there are specific links that hold great importance. Disruptions or failures in these critical links can lead to reduced connectivity within the road network. Under this circumstance, this manuscript proposed a novel identification of critical links mathematical optimization model based on the optimal reliable path with consideration of link correlations under demand uncertainty. The method presented in this paper offers a solution to bypass the necessity of conducting a full scan of the entire road network. Due to the non-additive and non-linear properties of the proposed model, a modified heuristic algorithm based on K-shortest algorithm and inequality technical is presented. The numerical experiments are conducted to show that improve a certain road link may not necessarily improve the overall traffic conditions. Moreover, the results indicate that if the travel time reliability is not considered, it will bring errors to the identification of key links.