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

Table 5

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

Departure time	Arrival time	Route
0–2	31	A-D-E-F-I
3–5	39	A-D-E-F-I
6–9	39	A-B-E-F-I
10	40	A-B-E-F-I
11	41	A-B-E-F-I
12	42	A-B-E-F-I
13	47	A-B-E-F-I
14	47	A-D-E-F-I
15–19	50	A-D-E-F-I
20–25	55	A-B-E-F-I
26	55	A-D-E-F-I
27-28	63	A-B-C-F-I
29-30	63	A-B-E-F-I
31	63	A-D-E-F-I
32–38	71	A-D-E-F-I
39-40	73	A-B-C-F-I
41–44	74	A-B-E-F-I
45-46	79	A-B-E-F-I
47–50	79	A-D-E-F-I
51–53	87	A-D-E-F-I
54–57	87	A-B-E-F-I
58	88	A-B-E-F-I
59	89	A-B-E-F-I
60	90	A-B-E-F-I
61	95	A-B-E-F-I
62	95	A-D-E-F-I
63–67	98	A-D-E-F-I
68–73	103	A-B-E-F-I
74	103	A-D-E-F-I
75–78	111	A-B-E-F-I
79	111	A-D-E-F-I
80–86	119	A-D-E-F-I
87	120	A-B-C-F-I
88	121	A-B-C-F-I
89–92	122	A-B-E-F-I
93-94	127	A-B-E-F-I
95–98	127	A-D-E-F-I
99–101	135	A-D-E-F-I
79	111	A-D-E-F-I
80–86	119	A-D-E-F-I
87	120	A-B-C-F-I
88	121	A-B-C-F-I
89–92	122	A-B-E-F-I
93-94	127	A-B-E-F-I
95–98	127	A-D-E-F-I
99–101	135	A-D-E-F-I
102–105	135	A-B-E-F-I
106	136	A-B-E-F-I
107	137	A-B-E-F-I
108	138	A-B-E-F-I
109	143	A-B-E-F-I
110	143	A-D-E-F-I
111–115	146	A-D-E-F-I
108	138	A-B-E-F-I
109	143	A-B-E-F-I
110	143	A-D-E-F-I
111–115	146	A-D-E-F-I
116–121	151	A-B-E-F-I
122	151	A-D-E-F-I
123-124	159	A-B-C-F-I
125-126	159	A-B-E-F-I
127	159	A-B-E-F-I
128–134	167	A-D-E-F-I
135	167	A-B-E-F-I
136–140	170	A-B-E-F-I
141-142	175	A-B-E-F-I