The most vital edge of the shortest path with incomplete information in traffic networks

There are always many road blockages caused by unexpected events such as accident or disasters in traffic networks. The vehicle can not get the information of edge failure until it travels to the blockage edge. This paper aims at the most vital edge of the shortest path problem with the incomplete information. Firstly, this paper states the concept of the most vital edge of the shortest path with incomplete information (MVEP-II). Secondly, it presents an algorithm of computing the MVEP-II and analyses its time complexity, and then a numerical result of urban traffic networks is given. In the end, by comparing the realistic result of MVEP-II problem, the longest detour problem and the most vital edge, we conclude that MVEP-II problem is more practically significant.