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

Table 11

The possible path for the first run.

Node	Arrival time	Departure time	Route used at arrival
Zone 7	—	9:00
14	9:05	9:12	Zone link
32	10:48	10:56	Line 1
28	12:01	12:01	Line 1
27	12:02	12:09	Walk
25	13:30	13:30	Line 2
Zone 13	13:35	—	Zone link