Research Article

The Global Optimal Algorithm of Reliable Path Finding Problem Based on Backtracking Method

Table 1

Comparisons of the proposed method with enumeration method.

OD pairsThe proposed method Results of enumeration method
The path sequenceThe effective travel time (min)The reliable path sequence between OD pair 1–9The effective travel time (min)

31.4132.47
22.0631.53
16.0331.41
21.5333.63
14.2132.80
23.6433.51