Robust Train Scheduling Problem with Optimized Maintenance Planning on High-Speed Railway Corridors: The China Case

Table 1

Notations.

Notations	Definition
	set of all stations.
	set of high-speed railway stations.
	set of normal-speed railway stations.
	set of major stations.
	index of stations.
	mapping from set to set , i.e., , .
	mapping from set to set , i.e., , .
	set of all trains.
	set of SDSA-trains.
	set of existing high-speed trains.
	set of existing normal-speed trains.
	index of trains.
	set of all scenarios.
	index of scenarios.
	origin/destination station of SDSA-train .
	minimum running time on section on high-speed railway/normal-speed railway.
	maximum running time on section on high-speed railway/normal-speed railway.
	running time of train on section on high-speed railway/normal-speed railway under scenario .
	minimal headway between consecutive arrival at station on high-speed railway.
	minimal headway between consecutive departure from station on high-speed railway.
	minimal headway between consecutive arrival at station on normal-speed railway.
	minimal headway between consecutive departure from station on normal-speed railway.
	the minimum dwelling time of each train at station on high-speed railway.
	the minimum dwelling time of each train at station on normal-speed railway.
	time window of SDSA-train departure from origin station.
	time window of SDSA-train arrival at destination station.
	time window of maintenance at high-speed railway station .
	the total passenger demand at major station on high-speed railway.
	the maximum capacity of SDSA-train .
	the width of maintenance window on high-speed railway.
	a large positive number.