Research Article

Minimizing Metro Transfer Waiting Time with AFCS Data Using Simulated Annealing with Parallel Computing

Table 1

Notations.

VariablesUnitsDescription

-Arrival / Departure time of train m at station i of line l
trains/hourTrain frequency of line l
minHeadway of line l
-Index of stations (i, j,)
-Index of lines ( and )
-The set of lines
-Index of pick-up/delivery trains (, and )
-The set of stations
pass/sNumber of passengers from stations i to j via transfer station s at t
-Index of routes (, and )
passNumber of transfer pass from train line to train m line l at s
passNumber of pass from sta. i to j on train line via train m line l at s
min/passAverage TWT at transfer station s / on line l / on route r
minTotal TWT
minTWT at transfer station s / on line l / on route r
-The set of routes
-Index of transfer stations (, and )
-The set of transfer stations
-Index of time
minTWT from train of line to train m of line l at station s
minWalking time from line to l at transfer station s
minPassenger travel time from stations i to j via transfer station s
minIn-vehicle time from stations i to j via transfer station s
minAdjustment of schedule departure time for trains on line l
minInitial waiting time at station i
-Binary var., 1 as passengers from train line to train m line l via s; otherwise, 0
-Binary var., 1 as transfer station s is on line l; otherwise, 0
-Binary var., 1 as line l belongs to route r; otherwise, 0