Research Article
Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks
Table 3
Cost calculation for the possible path
for a trip from Guangzhou to Liuzhou.
| | Actual value | Penalty | Weighted time |
| IVT-transit time | 238 | 1.0 | 238.0 | IVT-waiting time on train | 4 | 1.0 | 4.0 | Walking time | 0 | 2.0 | 0.0 | Waiting time at platform | 48 | 1.8 | 86.4 | Transfer | 1 | 1.0 | 1.0 | Fare | 185.5 | 0.625 | 296.8 | Sum | | | 626.2 |
|
|