Research Article
Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks
Table 8
The possible path
cost calculation in Example 2.
| | Actual value | Penalty | Weighted time |
| IVT-transit time | 192 | 1.0 | 192.0 | IVT-waiting time on train | 6 | 1.0 | 6.0 | Walking time | 0 | 2.0 | 0.0 | Waiting time at platform | 17 | 1.8 | 30.6 | Transfer | 1 | 1.0 | 1.0 | Fare | 388.5 | 0.625 | 621.6 | Sum | | | 851.2 |
|
|