Research Article
Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks
Table 13
The possible path for the third run.
| Node | Arrival time | Departure time | Route used at arrival |
| Zone 7 | — | 9:30 | | 13 | 9:35 | 9:41 | Zone link | 19 | 10:26 | 10:28 | Line 3 | 31 | 11:23 | 11:25 | Line 3 | 27 | 12:22 | 12:24 | Line 3 | 25 | 13:45 | 13:45 | Line 4 | Zone 13 | 13:50 | — | Zone link |
|
|