Study on the Shortest Reliable Path of Stochastic Time-Dependent Transportation Networks considering Waiting Time at Signalized Intersections

Table 6

The shortest path and the shortest travel time after changing the weight of the section.

Departure time	Arrival time	Route
0–3	45	A-D-E-H-I
4–6	45	A-B-E-H-I
7	48	A-B-E-H-I
8	49	A-B-E-H-I
9	50	A-B-E-H-I
10-11	51	A-B-E-H-I
12-13	56	A-B-C-F-I
14–17	59	A-D-E-F-I
18–22	61	A-B-E-H-I
23	62	A-B-E-H-I
24–26	64	A-B-C-F-I
27–29	71	A-B-E-H-I
30–42	80	A-B-C-F-I
43	81	A-B-C-F-I
44	82	A-B-C-F-I
45	83	A-B-C-F-I
46–51	93	A-D-E-H-I
52–54	93	A-B-E-H-I
55	94	A-B-E-H-I
56	95	A-B-E-H-I
57-58	96	A-B-C-F-I
59	97	A-B-C-F-I
60	98	A-B-C-F-I
61	99	A-B-C-F-I
62–65	105	A-D-E-H-I
66–71	111	A-B-E-H-I
72–77	115	A-B-C-F-I
78–86	128	A-B-C-F-I
87–92	131	A-B-E-H-I
93	132	A-B-E-H-I
94–99	141	A-D-E-H-I
100–102	141	A-B-E-H-I
103	142	A-B-E-H-I
104	143	A-B-E-H-I
105	144	A-B-E-H-I
106	144	A-B-C-F-I
107	151	A-B-E-H-I
108-109	153	A-B-E-H-I
110–113	153	A-D-E-H-I
114–119	160	A-B-E-F-I
120–122	160	A-B-C-F-I
123	161	A-B-C-F-I
124	162	A-B-C-F-I
125	163	A-B-C-F-I
126–138	176	A-B-C-F-I
139	177	A-B-C-F-I
140	178	A-B-C-F-I
141	179	A-B-C-F-I
142–147	191	A-D-E-H-I
148–152	191	A-B-E-H-I