Research Article
Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks
Table 4
Cost calculation for the possible path
for a trip from Guangzhou to Liuzhou.
| | Actual value | Penalty | Weighted time |
| IVT-transit time | 323 | 1.0 | 323.0 | IVT-waiting time on train | 2 | 1.0 | 2.0 | Walking time | 1 | 2.0 | 2.0 | Waiting time at platform | 3 | 1.8 | 5.4 | Transfer | 1 | 1.0 | 1.0 | Fare | 186.0 | 0.625 | 297.6 | Sum | | | 631.0 |
|
|