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

Table 4

The shortest reliable path and corresponding travel time at different departure time.

Departure time	Arrival time	Route
0	41	A-D-E-F-I
1–3	41	A-D-E-F-I
4–6	41	A-B-E-F-I
7	42	A-B-E-F-I
8	43	A-B-E-F-I
9–11	48	A-B-E-F-I
12-13	56	A-B-E-F-I
14–17	56	A-D-E-F-I
18–22	57	A-B-E-F-I
23	58	A-B-E-F-I
24–26	64	A-B-C-F-I
27–29	65	A-B-E-F-I
30–45	80	A-B-E-F-I
46–51	89	A-D-E-F-I
52–54	89	A-B-E-F-I
55	90	A-B-E-F-I
56	91	A-B-E-F-I
57–59	96	A-B-E-F-I
60	98	A-B-C-F-I
61	99	A-B-C-F-I
62	100	A-D-E-F-I
63–65	104	A-D-E-F-I
66–70	105	A-B-E-F-I
71	106	A-B-E-F-I
72–77	113	A-B-E-F-I
78–93	128	A-B-E-F-I
94–99	137	A-D-E-F-I
100–102	137	A-B-E-F-I
103	138	A-B-E-F-I
104	139	A-B-E-F-I
105–107	144	A-B-E-F-I
108–110	152	A-B-E-F-I
111–113	152	A-D-E-F-I
114–118	153	A-B-E-F-I
119	154	A-B-E-F-I
120–122	160	A-B-C-F-I
123–125	161	A-B-E-F-I
126–141	176	A-B-E-F-I