Research Article
Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks
Table 15
The possible path for using 752 mins in the fourth run.
| Node | Arrival time | Departure time | Route used at arrival |
| Zone 7 | — | 9:45 | | 13 | 9:50 | 9:53 | Zone link | 21 | 11:38 | 11:42 | Line 5 | 23 | 13:49 | 14:19 | Line 5 | 25 | 15:35 | 15:35 | Line 6 | Zone 13 | 15:40 | — | Zone link |
|
|