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

Table 16

The possible path cost calculation for using 752 mins in the fourth run.

	Actual value	Penalty	Weighted time
Transit time	308	1.0	308.0
Waiting time on train	4	1.0	4.0
Walking time	0	2.0	0.0
Waiting time at platform	33	1.8	59.4
Waiting time at home	45	0.5	22.5
Travel between zones and stations	10	1.0	10.0
Transfer	1	1.0	1.0
Fare	231	0.625	369.6
Sum			774.5