First-Train Timetable Synchronization in Metro Networks under Origin-Destination Demand Conditions

Table 1

Comparison between this paper and the most relevant literature.

Publication	Problem type	Train capacity	Passenger demand	Objective function	Passenger travel route	Algorithm
Wong et al. [18]	All trains	No	Transfer-direction-based demand	Minimize waiting time	No	CPLEX-based heuristic
Shafahi and Khani [20]	All trains	No	Station-based demand	Minimize waiting time	No	GA
Zhou et al. [23]	Last train	No	Static OD demand	Maximize OD accessibility	Yes	CPLEX
Chen et al. [5]	Last train	No	Station-based demand	Maximize the number of transfer passengers	No	CPLEX
Chen et al. [6]	Last train	No	Static OD demand	Maximize percentage of accessible OD pairs	Yes	GA
Yang et al. [24]	Last train	No	Time-dependent OD demand	Maximize space-time accessibility	Yes	LR
Guo et al. [2]	First train	No	Transfer-direction-based demand	Minimize connection time	No	CPLEX
Kang et al. [1]	First train	No	Transfer-direction-based demand	Minimize waiting time	No	Heuristic
This paper	First train	No	Static OD demand	Minimize travel time; Minimize schedule deviation	Yes	NSGA-II