Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks

Table 12

The possible path cost calculation for the first run.

	Actual value	Penalty	Weighted time
IVT-transit time	242	1.0	242.0
IVT-waiting time on train	8	1.0	8.0
Walking time	1	2.0	2.0
Waiting time at platform	14	1.8	25.2
Waiting time at home	0	0.5	0.0
Travel between zones and stations	10	1.0	10.0
Transfer	1	1.0	1.0
Fare	185.5	0.625	296.8
Sum			585.0