Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks

Table 9

The possible path using the second extension in Example  2.

Node	Arrival time	Departure time	Route used at arrival	Fare (yuan)
17	9:30	9:40		388.5
15	9:57	9:59	Line 2
13	10:16	10:23	Line 2
11	11:48	11:50	Line 2
9	12:23	12:25	Line 2
3	13:05	—	Line 2