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

Authors: Liang Shen; Hu Shao; Long Zhang; Jian Zhao
Journal: Mathematical Problems in Engineering
 (2017)

---

## Abstract

There is a growing interest in finding a global optimal path in transportation networks particularly when the network suffers from unexpected disturbance. This paper studies the problem of finding a global optimal path to guarantee a given probability of arriving on time in a network with uncertainty, in which the travel time is stochastic instead of deterministic. Traditional path finding methods based on least expected travel time cannot capture the network user’s risk-taking behaviors in path finding. To overcome such limitation, the reliable path finding algorithms have been proposed but the convergence of global optimum is seldom addressed in the literature. This paper integrates theK-shortest path algorithm into Backtracking method to propose a new path finding algorithm under uncertainty. The global optimum of the proposed method can be guaranteed. Numerical examples are conducted to demonstrate the correctness and efficiency of the proposed algorithm.


---

## Body

## 1. Introduction

Finding a global optimal path in networks is a practical problem among communication and transportation. It has attracted much attention from researchers in numerous fields owing to its broad applications. The traditional path finding algorithms usually used the shortest average travel time as selection criteria. But in real networks, traffic condition is affected by many uncertain factors and the travel time is stochastic. Under such circumstances, the network users may face the risk of being late. For example, when scheduling significant issues (e.g., taking a flight), a network user needs to budget an extra travel time to guarantee a higher reliability of arriving on time. Then, it is very important for researchers to take travel time reliability into consideration for path finding. Thus, the travel time reliability-based path finding problem has attracted much attention by some recently proposed algorithms. However, few of them can guarantee the global optimum of the solution. In view of this, the problem of finding a global optimal path based on time reliability is studied in this paper.


## 2. Literature Review

The problem of finding optimal path in a transportation network has been investigated for a long time in the field of algorithm design and operation research. Most of these path finding algorithms were usually investigated under an ideal traffic condition; that is, the travel times are deterministic. For example, Andreatta and Romeo [1] considered Stochastic Shortest Path (SSP) problems in probabilistic networks. Polychronopoulos and Tsitsiklis [2] considered shortest path problems defined on graphs with random arc costs. And it assumed that information on arc cost values is accumulated as the graph is being traversed. Miller-Hooks and Mahmassani [3] addressed the problem of determining least expected time paths in stochastic, time-varying networks. Gao and Chabini [4] studied optimal routing policy problems in stochastic time-dependent networks, where link travel times are modeled as random variables with time-dependent distributions. Minh and Pumwa [5] addressed the problem of finding feasible path planning algorithms for nonholonomic vehicles. Most of all these existing path finding algorithms have been investigated under various conditions, but the reliability of on-time arrival or the risk of being late in path finding problems has not received much attention.The unreliability (or uncertainty) issue has been considered in some recently developed algorithms (Andreatta and Romeo [1], Polychronopoulos and Tsitsiklis [2], Fu and Rilett [6], and Zhang et al. [7]). When scheduling important issues (e.g., attending a conference), a network user considers a shorter travel time, as well as a higher reliability of on-time arrival. Based on the above discussion, the definition of travel time reliability is defined as the probability that a network user can arrive at the destination within a given travel time threshold. To account for this issue, Frank [8] developed an efficient method of hypothesis testing to solve the problem of finding shortest path probability distributions in graphs. Shao et al. [9] proposed a heuristic algorithm to search for the highest reliability path. Chen and Ji [10] developed a simulation-based genetic algorithm procedure to solve these path finding models under uncertainties. Ying [11] presented a reliable routing algorithm with real time and historical information. Nie and Wu [12] studied the problem of finding a prior shortest path to guarantee a given likelihood of arriving on time in a stochastic network. Chen et al. [13] proposed an efficient algorithm for finding a risk-averse path for users in autonomous vehicle navigation systems. By making use of information computed at the start of the trip, the authors presented a responsive version of the constrained A∗ search, which reduced the on-demand response time. Khani and Boyles [14] studied the reliable path problem in the form of minimizing the sum of mean and standard deviation of path travel time. Chen et al. [15] investigated the problem of finding the K-reliable shortest paths (KRSP) in stochastic networks under travel time uncertainty. In such study, a deviation path algorithm was proposed to exactly solve the KRSP problem in large-scale networks. However, all these studies cannot guarantee the global optimum of the solution for path finding.The main difficulty of finding the optimum of the reliable path is due to the nonadditive property of the travel time reliability. The path travel time reliability cannot be expressed as the sum of some terms corresponding to the links. Thus, the reliable path finding problem has been regarded as one of the nonadditive path cost problems. There is no simple way of converting the nonadditive route cost to equivalent link costs (Chen et al. [16]). Therefore, to search the reliable path needs to enumerate all the alternative paths between each O-D pair. This is of great difficulty for large-scale transportation networks. In this paper, the K-shortest finding algorithm is adopted so as to find the global optimum of the reliable path.Some methods have been proposed to solve theK-shortest finding problem during the past two decades. Eppstein [17] gave algorithms for finding the K-shortest paths connecting a pair of vertices in a digraph, and cycles of repeated vertices are allowed. Hershberger et al. [18] described a new algorithm to enumerate the K-shortest simple (loopless) paths in a directed graph and reported on its implementation. It was based on a replacement paths algorithm. Carlyle and Wood [19] proposed a new algorithm for solving the problem of enumerating all near-shortest simple (loopless) paths in a graph with nonnegative edge lengths. Liu and Ramakrishnan [20] presented a new algorithm, A∗ Prune, to list the first K Multi-Constrained-Shortest Path (KMCSP) between a given pair of nodes in a digraph. Although there exist a lot of K-shortest algorithms, few of them have been used for solving the reliability-based path finding problem.In this paper, theK-shortest algorithm is integrated into the Backtracking algorithm for proposing a new reliability-based path finding algorithm. The Backtracking algorithm is widely used for finding solutions in some problem with high computational cost. It can find the optimum of the concerned problem. The efficiency of the Backtracking algorithm is based on the pruning function. An efficient pruning function is capable of saving the computational time for the implementation of Backtracking algorithm. In this paper, the results of the K-shortest algorithm are used as the threshold for the pruning function to improve the computational efficiency of the Backtracking algorithm. The main contributions of the proposed algorithm are given as follows.(1) The new reliability-based path finding algorithm under uncertainty is presented based on the Backtracking algorithm. In this new algorithm, the global optimum solution of the proposed problems can be guaranteed.(2) An efficient pruning function is capable of saving the computational time. Moreover, the K-shortest path finding algorithm is employed to further reduce the computational time of the proposed algorithm.In the next section, the definition of reliable path will be introduced first, and then the detailed steps of the algorithm are presented. In Section4, numerical examples are carried out to demonstrate the applications of the proposed method. Finally, Section 5 concludes the paper with possible directions for future research.


## 3. Global Optimal Path Finding Algorithm under Uncertainty

The optimal path is defined to find the path with minimum travel time budget (or effective travel time) in this paper (Chen et al. [21–25]). As aforementioned, it is difficult to find the path with minimum effective travel time unless enumerating all the paths. In order to avoid path enumeration while finding the reliable path, Wang et al. [26] proposed a heuristic solution algorithm using the K-shortest paths algorithm. However, the proposed algorithm in Wang et al. [26] cannot find out the global optimal solution. Thus, the Backtracking method is adopted in order to find the reliability-based global optimal path in this section.To facilitate the presentation of the essential ideas without loss of generality, the following basic assumptions are made in this paper.(A1) Due to network uncertainties, the travel time on each link is assumed to follow the normal distribution. The travel time on path between each OD pair is the summation of the link travel times on that path. For simplicity, it is assumed that the path travel time also follows the Normal distribution (Chang et al. [27]).(A2) The link travel times are nonnegative and all link travel times are statistically independent.(A3) Following the assumptions in Chen et al. [21–25], the reliable path is defined as the path with minimum effective travel time in this paper.(A4) The travel time budget (or effective travel time) is defined as the sum of mean travel time and safe margin.


### 3.1. The Definition of Reliable Path

According to assumption (A1), it is assumed that expected travel time (or mean travel time) on pathk between OD pair w is expressed as follows:(1)tkw=∑a∈Aδk,awta,∀k∈Kw,w∈ROD,where Kw is the set of all paths between OD pair w and OD is the set of all OD pairs. It follows from assumption (A2) that the travel time variance on path k between OD pair w can be written as (2)σkw2=∑a∈Aδk,awσα2,∀k∈Kw,w∈ROD.Following assumption (A1), the travel time on path k between OD pair w follows Normal distribution as follows:(3)Tkw~Ntkw,σkw,∀k∈Kw,w∈ROD,where ta and σa are the mean and standard deviation of the travel time on link a, respectively; δk,aw is the path-link incidence parameter; and δk,aw=1 if path k uses link a and δk,aw=0 otherwise.According to Lo et al. [28], the travel time budget (or effective travel time) associated with path k can be written as(4)t^kw=tkw+λσkw,∀k∈Kw,w∈ROD,where λ is a parameter related to the risk-taking behaviors of the travelers. According to assumption (A4), in order to avoid late arrival penalty, an additional travel time budget named safety margin, that is, λσkw, is proposed to ensure a more certain on-time arrival probability by the travelers. Mathematically, the additional travel time budget λσkw can be determined by the following chance constraint model:(5)minλ⁡t^kw=tkw+λσkws.t.Pr⁡Tkw≤t^kw≥ρ,where ρ is a given confidence level. If the network user wants the probability of arriving at the destination to be not less than 95%, then set the probability ρ=95%. By a simple manipulation, λ can be determined as the total travel time budget in minimization (5); then the parameter can be expressed as follows:(6)λ=Φ-1ρ,where Φ(·) is the cumulative distribution function (CDF) of standard normal distribution.The definition of travel time budget ensures the on-time arrival reliability to be greater than or equal toρ, while minimizing the travel time budget. Then, according to assumption (A3), the reliable path can be defined as follows: among all the paths between OD pair w, the reliable path between OD pair w is the path with minimum travel time budget. Mathematically, path k∗ is the reliable path between OD pair w if and only if (7)kw,p∗=argmink⁡t^kw.Then, the candidate path set M(p) consists of the two path sets; that is,(8)Mw,p=Mmtw,p∪Msmw,p,where Mmtw,(p) includes allp-shortest paths in terms of minimum mean travel time and Msmw,(p) includes all p-shortest paths in terms of minimum variance. Due to the additive property of the mean travel time and the variance, the conventional K-shortest methods can be utilized to generate Mmtw,(p) and Msmw,(p) without generating all the paths between OD pair w. It is known that ifp is large enough, then Mw,(p) covers all the paths between OD pair w. Then, the reliable path can be found by calculating the travel time budgets of all the paths in set Mw,(p). Therefore, the reliable path can be obtained in set Mw,(p) and it can be expressed as follows: (9)kw,p∗=argmink∈Mw,p⁡t^kw.


### 3.2. The Algorithm Description

Backtracking method adapted herein is a widely used algorithm for integer programming. If an appropriate/effective pruning function is defined in Backtracking method, the algorithm may quickly converge to the global optimum. The pruning function is adopted to avoid searching the feasible solutions which are not optimal solutions so as to save the computational time. The advantage of this algorithm is that it can guarantee finding out the global optimal solution. The proposed heuristic algorithm is shown as follows.Firstly, we need to define two kinds of data structures: Stack and List. The Stack has the property of LIFO (Last in First out) and it is used to store the nodes which have not been visited. The List is used to store the nodes which have been visited before.Step 1.
Put initial nodes into Stack and carry out the local optimal searching algorithm within the set Mp using heuristic algorithm in Carlyle and Wood [19]. Then, the effective travel time of the local optimal reliable path is defined as UB (upper bound). The upper bound of the effective travel time is selected as initial pruning function. Denote the corresponding reliable path as P.Step 2.
If the Stack is empty, then stop. Otherwise, go to Step3.Step 3.
Select the first nodeVi from the Stack and move the node to the List which is connected to node Vi.Step 4.
Denote the current path asPi. If node Vi is the destination node, then calculate the effective travel time of path Pi and denote it as ET. If ET>UB, then go to Step 2. Otherwise, update UB=ET and P=Pi; then go to Step 2. If node Vi is not the destination node, then go to Step 5.Step 5.
Extend the subsequent nodes ofVi and put all the subsequent nodes into Stack.Step 6.
Select the first nodeVj from the Stack. (i)
IfVj∈Pi, then move the node Vj from the Stack to the List and go to Step 6. Otherwise, calculate the effective travel time of the reliable path Pj=[Pi,Vj] and denote it as ET.(ii)
IfVj is the destination node and ET>UB, then move Vj from the Stack to the List and go to Step 6. If ET≤UB, update UB=ET and P=Pi and then move node Vj from the Stack to the List and go to Step 6.(iii)
IfVj is not the destination node and ET>UB, then move node Vj from the Stack to the List and go to Step 6. If ET≤UB, then move node Vj from the Stack to the List and go to Step 2.Based on the algorithm steps, the flow chart of the algorithm is shown in Figure1.Figure 1
The flow chart of the global algorithm of reliable path finding.


## 3.1. The Definition of Reliable Path

According to assumption (A1), it is assumed that expected travel time (or mean travel time) on pathk between OD pair w is expressed as follows:(1)tkw=∑a∈Aδk,awta,∀k∈Kw,w∈ROD,where Kw is the set of all paths between OD pair w and OD is the set of all OD pairs. It follows from assumption (A2) that the travel time variance on path k between OD pair w can be written as (2)σkw2=∑a∈Aδk,awσα2,∀k∈Kw,w∈ROD.Following assumption (A1), the travel time on path k between OD pair w follows Normal distribution as follows:(3)Tkw~Ntkw,σkw,∀k∈Kw,w∈ROD,where ta and σa are the mean and standard deviation of the travel time on link a, respectively; δk,aw is the path-link incidence parameter; and δk,aw=1 if path k uses link a and δk,aw=0 otherwise.According to Lo et al. [28], the travel time budget (or effective travel time) associated with path k can be written as(4)t^kw=tkw+λσkw,∀k∈Kw,w∈ROD,where λ is a parameter related to the risk-taking behaviors of the travelers. According to assumption (A4), in order to avoid late arrival penalty, an additional travel time budget named safety margin, that is, λσkw, is proposed to ensure a more certain on-time arrival probability by the travelers. Mathematically, the additional travel time budget λσkw can be determined by the following chance constraint model:(5)minλ⁡t^kw=tkw+λσkws.t.Pr⁡Tkw≤t^kw≥ρ,where ρ is a given confidence level. If the network user wants the probability of arriving at the destination to be not less than 95%, then set the probability ρ=95%. By a simple manipulation, λ can be determined as the total travel time budget in minimization (5); then the parameter can be expressed as follows:(6)λ=Φ-1ρ,where Φ(·) is the cumulative distribution function (CDF) of standard normal distribution.The definition of travel time budget ensures the on-time arrival reliability to be greater than or equal toρ, while minimizing the travel time budget. Then, according to assumption (A3), the reliable path can be defined as follows: among all the paths between OD pair w, the reliable path between OD pair w is the path with minimum travel time budget. Mathematically, path k∗ is the reliable path between OD pair w if and only if (7)kw,p∗=argmink⁡t^kw.Then, the candidate path set M(p) consists of the two path sets; that is,(8)Mw,p=Mmtw,p∪Msmw,p,where Mmtw,(p) includes allp-shortest paths in terms of minimum mean travel time and Msmw,(p) includes all p-shortest paths in terms of minimum variance. Due to the additive property of the mean travel time and the variance, the conventional K-shortest methods can be utilized to generate Mmtw,(p) and Msmw,(p) without generating all the paths between OD pair w. It is known that ifp is large enough, then Mw,(p) covers all the paths between OD pair w. Then, the reliable path can be found by calculating the travel time budgets of all the paths in set Mw,(p). Therefore, the reliable path can be obtained in set Mw,(p) and it can be expressed as follows: (9)kw,p∗=argmink∈Mw,p⁡t^kw.


## 3.2. The Algorithm Description

Backtracking method adapted herein is a widely used algorithm for integer programming. If an appropriate/effective pruning function is defined in Backtracking method, the algorithm may quickly converge to the global optimum. The pruning function is adopted to avoid searching the feasible solutions which are not optimal solutions so as to save the computational time. The advantage of this algorithm is that it can guarantee finding out the global optimal solution. The proposed heuristic algorithm is shown as follows.Firstly, we need to define two kinds of data structures: Stack and List. The Stack has the property of LIFO (Last in First out) and it is used to store the nodes which have not been visited. The List is used to store the nodes which have been visited before.Step 1.
Put initial nodes into Stack and carry out the local optimal searching algorithm within the set Mp using heuristic algorithm in Carlyle and Wood [19]. Then, the effective travel time of the local optimal reliable path is defined as UB (upper bound). The upper bound of the effective travel time is selected as initial pruning function. Denote the corresponding reliable path as P.Step 2.
If the Stack is empty, then stop. Otherwise, go to Step3.Step 3.
Select the first nodeVi from the Stack and move the node to the List which is connected to node Vi.Step 4.
Denote the current path asPi. If node Vi is the destination node, then calculate the effective travel time of path Pi and denote it as ET. If ET>UB, then go to Step 2. Otherwise, update UB=ET and P=Pi; then go to Step 2. If node Vi is not the destination node, then go to Step 5.Step 5.
Extend the subsequent nodes ofVi and put all the subsequent nodes into Stack.Step 6.
Select the first nodeVj from the Stack. (i)
IfVj∈Pi, then move the node Vj from the Stack to the List and go to Step 6. Otherwise, calculate the effective travel time of the reliable path Pj=[Pi,Vj] and denote it as ET.(ii)
IfVj is the destination node and ET>UB, then move Vj from the Stack to the List and go to Step 6. If ET≤UB, update UB=ET and P=Pi and then move node Vj from the Stack to the List and go to Step 6.(iii)
IfVj is not the destination node and ET>UB, then move node Vj from the Stack to the List and go to Step 6. If ET≤UB, then move node Vj from the Stack to the List and go to Step 2.Based on the algorithm steps, the flow chart of the algorithm is shown in Figure1.Figure 1
The flow chart of the global algorithm of reliable path finding.


## 4. Numerical Examples

Numerical examples are carried out to demonstrate the applications of the proposed algorithm using a small-sized network and a medium-sized network.


### 4.1. Validation of the Proposed Algorithm

A small-sized network is adopted to verify the proposed algorithm. The network used in this example is shown in Figure2. The mean and standard deviation of link travel time are shown near each link in this figure with the format “mean/standard deviation” in minute. In this example, the confidence level is assumed to ρ=95% and K=3.Figure 2
An example network for reliable path problem.The results of the proposed algorithm are given in Table1. It can be seen that the reliable path from node 1 to node 9 is 14569 and the effective travel time is 31.41 minutes. The enumeration method is adopted to validate this solution and the corresponding results of the proposed algorithm are also shown in Table 1. It is clear that the solution of the heuristic solution algorithm is the same as the enumeration result and this demonstrates that the proposed heuristic algorithm in this paper is correct.Table 1
Comparisons of the proposed method with enumeration method.
OD pairs
The proposed method
Results of enumeration method
The path sequence
The effective travel time (min)
The reliable path sequence between OD pair 1–9
The effective travel time (min)
(
1,9
)
[
1
4
5
6
9
]
31.41
[
1
2
5
6
9
]
32.47
(
1,8
)
[
1
4
5
8
]
22.06
[
1
4
5
8
9
]
31.53
(
1,7
)
[
1
4
7
]
16.03
[
1
4
5
6
9
]
31.41
(
1,6
)
[
1
4
5
6
]
21.53
[
1
4
7
8
9
]
33.63
(
1,5
)
[
1
4
5
]
14.21
[
1
2
5
8
9
]
32.80
(
2,9
)
[
2
5
6
9
]
23.64
[
1
2
3
6
9
]
33.51


### 4.2. Comparisons with Existing Reliability-Based Path Finding Algorithms

The network used in this example is shown in Figure3. The mean and standard deviations of link travel time are shown in Table 2. In this example, the confidence level is assumed to ρ=95% and K=3.Table 2
The mean and standard deviations of each link travel time.
Link number
Mean/variance
1
3.6/3.7
2
2.4/11.7
3
3.6/17.6
4
3.0/3.7
5
2.4/12.2
6
2.4/9
7
2.4/12.2
8
2.4/4.2
9
1.2/7.7
10
3.6/9
11
1.2/11.7
12
2.4/4.2
13
3.0/8
14
3.0/7.7
15
2.4/8
16
1.2/9.5
17
1.8/4.2
18
1.2/9.5
19
1.2/7.4
20
1.8/4.3
21
2.0/4.2
22
3.0/3.1
23
3.0/2
24
2.0/7.4
25
1.8/9.4
26
1.8/16.3
27
3.0/3.1
28
3.6/9.4
29
3.0/20
30
4.2/10.7
31
3.6/9
32
2.4/4.3
33
3.6/12.3
34
2.4/13.8
35
2.4/9
36
3.6/12.2
37
1.8/13.8
38
1.8/17.6
39
2.4/3
40
2.4/3
41
3.0/13.7
42
2.4/4
43
3.6/13.8
44
3.0/13.7
45
2.4/12.2
46
2.4/7.2
47
3.0/16.3
48
3.0/20
49
1.2/13.8
50
1.8/12.2
51
4.2/5.7
52
1.2/5.7
53
1.2/15
54
1.2/9.6
55
1.8/10.7
56
2.4/15
57
2.4/5.5
58
1.2/14.8
59
2.4/2
60
2.4/5.5
61
2.4/14.8
62
3.6/10
63
3.0/6.5
64
3.6/9.6
65
1.2/14.6
66
1.8/2.3
67
2.4/7.2
68
3.0/2.3
69
1.2/4.2
70
1.4/4
71
2.4/4.2
72
2.4/4
73
1.2/6.5
74
2.4/6
75
1.8/4
76
2.0/6Figure 3
Sioux Falls network.For comparison purpose, a heuristic solution algorithm for travel time reliability-based (Wang et al. [26]) has been employed. The results of such algorithm and the proposed algorithm are shown in Table 3. It can be seen that the proposed method outperformed the algorithm of Wang et al. [26]. For example, for OD pair (1,24), the proposed method can find the global reliable path (with effective travel time of 45.3438 minutes) but the algorithm of Wang et al. [26] can only find the local reliable path (with effective travel time of 53.0493 minutes). It can be seen from this example that the proposed algorithm can find more reliable path than the algorithm of Wang et al. [26].Table 3
Comparisons of the proposed method with existing method.
OD pairs
The proposed method
Heuristic method in Wang et al. (2010)
The path sequence
The effective travel time (min)
The reliable path sequence
The effective travel time (min)
(
1,24
)
[
1
3
12
13
24
]
45.3438
[
1
2
6
8
9
10
15
22
21
24
]
53.0439
(
1,23
)
[
1
3
12
13
24
23
]
48.6681
[
1
2
6
8
9
10
15
22
23
]
51.1572
(
1,20
)
[
1
2
6
8
7
18
20
]
48.2550
[
1
2
6
8
7
18
20
]
48.2550
(
1,15
)
[
1
2
6
8
9
10
15
]
44.3443
[
1
2
6
8
9
10
15
]
44.3443
(
2,23
)
[
2
6
8
9
10
15
22
23
]
46.9724
[
2
6
8
9
10
15
22
23
]
46.9724
(
2,20
)
[
2
6
8
7
18
20
]
44.1193
[
2
6
8
7
18
20
]
44.1193
(
2,15
)
[
2
6
8
9
10
15
]
40.0977
[
2
6
8
9
10
15
]
40.0977
(
5,20
)
[
5
9
10
15
22
20
]
42.2762
[
5
9
10
15
22
20
]
42.2762
(
24,1
)
[
24
23
14
11
4
3
1
]
44.2569
[
24
23
14
11
4
3
1
]
44.2569
(
23,2
)
[
23
14
11
4
5
6
2
]
40.7664
[
23
14
11
4
5
6
2
]
40.7664


## 4.1. Validation of the Proposed Algorithm

A small-sized network is adopted to verify the proposed algorithm. The network used in this example is shown in Figure2. The mean and standard deviation of link travel time are shown near each link in this figure with the format “mean/standard deviation” in minute. In this example, the confidence level is assumed to ρ=95% and K=3.Figure 2
An example network for reliable path problem.The results of the proposed algorithm are given in Table1. It can be seen that the reliable path from node 1 to node 9 is 14569 and the effective travel time is 31.41 minutes. The enumeration method is adopted to validate this solution and the corresponding results of the proposed algorithm are also shown in Table 1. It is clear that the solution of the heuristic solution algorithm is the same as the enumeration result and this demonstrates that the proposed heuristic algorithm in this paper is correct.Table 1
Comparisons of the proposed method with enumeration method.
OD pairs
The proposed method
Results of enumeration method
The path sequence
The effective travel time (min)
The reliable path sequence between OD pair 1–9
The effective travel time (min)
(
1,9
)
[
1
4
5
6
9
]
31.41
[
1
2
5
6
9
]
32.47
(
1,8
)
[
1
4
5
8
]
22.06
[
1
4
5
8
9
]
31.53
(
1,7
)
[
1
4
7
]
16.03
[
1
4
5
6
9
]
31.41
(
1,6
)
[
1
4
5
6
]
21.53
[
1
4
7
8
9
]
33.63
(
1,5
)
[
1
4
5
]
14.21
[
1
2
5
8
9
]
32.80
(
2,9
)
[
2
5
6
9
]
23.64
[
1
2
3
6
9
]
33.51


## 4.2. Comparisons with Existing Reliability-Based Path Finding Algorithms

The network used in this example is shown in Figure3. The mean and standard deviations of link travel time are shown in Table 2. In this example, the confidence level is assumed to ρ=95% and K=3.Table 2
The mean and standard deviations of each link travel time.
Link number
Mean/variance
1
3.6/3.7
2
2.4/11.7
3
3.6/17.6
4
3.0/3.7
5
2.4/12.2
6
2.4/9
7
2.4/12.2
8
2.4/4.2
9
1.2/7.7
10
3.6/9
11
1.2/11.7
12
2.4/4.2
13
3.0/8
14
3.0/7.7
15
2.4/8
16
1.2/9.5
17
1.8/4.2
18
1.2/9.5
19
1.2/7.4
20
1.8/4.3
21
2.0/4.2
22
3.0/3.1
23
3.0/2
24
2.0/7.4
25
1.8/9.4
26
1.8/16.3
27
3.0/3.1
28
3.6/9.4
29
3.0/20
30
4.2/10.7
31
3.6/9
32
2.4/4.3
33
3.6/12.3
34
2.4/13.8
35
2.4/9
36
3.6/12.2
37
1.8/13.8
38
1.8/17.6
39
2.4/3
40
2.4/3
41
3.0/13.7
42
2.4/4
43
3.6/13.8
44
3.0/13.7
45
2.4/12.2
46
2.4/7.2
47
3.0/16.3
48
3.0/20
49
1.2/13.8
50
1.8/12.2
51
4.2/5.7
52
1.2/5.7
53
1.2/15
54
1.2/9.6
55
1.8/10.7
56
2.4/15
57
2.4/5.5
58
1.2/14.8
59
2.4/2
60
2.4/5.5
61
2.4/14.8
62
3.6/10
63
3.0/6.5
64
3.6/9.6
65
1.2/14.6
66
1.8/2.3
67
2.4/7.2
68
3.0/2.3
69
1.2/4.2
70
1.4/4
71
2.4/4.2
72
2.4/4
73
1.2/6.5
74
2.4/6
75
1.8/4
76
2.0/6Figure 3
Sioux Falls network.For comparison purpose, a heuristic solution algorithm for travel time reliability-based (Wang et al. [26]) has been employed. The results of such algorithm and the proposed algorithm are shown in Table 3. It can be seen that the proposed method outperformed the algorithm of Wang et al. [26]. For example, for OD pair (1,24), the proposed method can find the global reliable path (with effective travel time of 45.3438 minutes) but the algorithm of Wang et al. [26] can only find the local reliable path (with effective travel time of 53.0493 minutes). It can be seen from this example that the proposed algorithm can find more reliable path than the algorithm of Wang et al. [26].Table 3
Comparisons of the proposed method with existing method.
OD pairs
The proposed method
Heuristic method in Wang et al. (2010)
The path sequence
The effective travel time (min)
The reliable path sequence
The effective travel time (min)
(
1,24
)
[
1
3
12
13
24
]
45.3438
[
1
2
6
8
9
10
15
22
21
24
]
53.0439
(
1,23
)
[
1
3
12
13
24
23
]
48.6681
[
1
2
6
8
9
10
15
22
23
]
51.1572
(
1,20
)
[
1
2
6
8
7
18
20
]
48.2550
[
1
2
6
8
7
18
20
]
48.2550
(
1,15
)
[
1
2
6
8
9
10
15
]
44.3443
[
1
2
6
8
9
10
15
]
44.3443
(
2,23
)
[
2
6
8
9
10
15
22
23
]
46.9724
[
2
6
8
9
10
15
22
23
]
46.9724
(
2,20
)
[
2
6
8
7
18
20
]
44.1193
[
2
6
8
7
18
20
]
44.1193
(
2,15
)
[
2
6
8
9
10
15
]
40.0977
[
2
6
8
9
10
15
]
40.0977
(
5,20
)
[
5
9
10
15
22
20
]
42.2762
[
5
9
10
15
22
20
]
42.2762
(
24,1
)
[
24
23
14
11
4
3
1
]
44.2569
[
24
23
14
11
4
3
1
]
44.2569
(
23,2
)
[
23
14
11
4
5
6
2
]
40.7664
[
23
14
11
4
5
6
2
]
40.7664


## 5. Conclusion and Future Studies

This paper proposed a global optimal algorithm for travel time reliability-based path finding problem using Backtracking method. The traditional path finding algorithms usually used the shortest average travel time as selection criteria. But traffic condition is realistically affected by many uncertain factors and the travel time is stochastic in reality. Under such circumstances, the travelers suffer from the risk of being late. In view of this, researchers take travel time reliability into consideration while making path choice decisions. Due to the nonadditive property of the travel time reliability, finding the reliability-based path needs to enumerate all the paths between the OD pair, which is very time consuming for large-scale network. To address this issue, a new path finding algorithm was proposed in this paper by integrating theK-shortest paths algorithm into Backtracking method. This proposed method can guarantee the global optimum of the solution. Numerical studies illustrated that the proposed algorithm is capable of finding the globally reliable path and outperforming the existing algorithm.On the basis of the solution algorithm proposed in this paper, some further extensions can be envisaged as follows:(i)
Some new techniques, such as the multicriteriaA∗algorithm (Chen at al. [21]), the multicriteria label-setting algorithm (Chen at al. [23]), and the Lagrangian substitution algorithm (Xing and Zhou [29]), could be employed in the proposed algorithm to provide a more efficient pruning function so as to further accelerate the convergence of the algorithm.(ii)
How to incorporate the proposed algorithm into the reliability-based traffic assignment problem reveals significant investigations in further studies.(iii)
Different travelers may have different attitudes toward risk of being late. Such kind of multiple risk-taking behaviors could be formulated as multiclass path choice criteria. How to modify the proposed algorithm to account for multiclass path choice criteria deserves extensions.(iv)
The proposed algorithm is designed for static path finding problem and as such this method is different from the algorithm of the dynamic path finding problem. How to extend such method to the dynamic reliable path finding problems (e.g., Li et al. [30]) is worthy of further investigation.(v)
The proposed algorithm can be combined with some stochastic travel time estimation methods (Tam and Lam [31, 32]; Chang et al. [33]; Shao et al. [34, 35]) so as to provide a reliable route guidance system in reality.



---

*Source: 4586471-2017-10-18.xml*