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

Table 1

The possible path for a trip from Guangzhou to Liuzhou.

Node	Arrival time	Departure time	Route used at arrival	Fare (yuan)
13	9:30	9:36
19	10:21	10:23	Line 1
31	11:18	11:20	Line 1	137.5
27	12:17	12:59	Line 1
25	14:20	—	Line 2	48.0