Hybrid Dynamic Route Planning Model for Pedestrian Microscopic Simulation at Subway Station

Table 1

Algorithm of local route planning.

Input	(a) A set of local path, J
	(b) Preference of pedestrian i, and
	(c) Current speed and position (xi, yi) of pedestrian i at time t
Output	A suitable local path for pedestrian i at time t
1	For each local path j in J, do
2	…estimate total walking distance by Equations ((4), (5)). (when pedestrian i is closed to the gates, can be simplified to in Equation (12))
3	……calculate walking time by Equation (3)
4	…estimate the number of passengers queueing at local path j by Equation (7)
5	……calculate waiting time by Equation (6)
6	…calculate the estimated passing time of path j by Equation (2)
7	End for
8	If pedestrian i is closed enough to the ticket gates,  then
9	…pass through the local path with minimum estimated passing time by Equation (13)
10	else calculate the probability of pedestrian i choose local path j by Equation (8)
11	…choose a suitable local path for pedestrian i based on and a random number
12	End if