Synchronous Optimization for Demand-Driven Train Operation Plan in Rail Transit Network Using Nondominated Sorting Coevolutionary Memetic Algorithm

Table 2

Parameters of the case.

Parameter	Description	Value
	The number of lines	2
	The number of stations in each direction	22 (line 1, line 2), 44 (total)
	The number of transfer stations in each direction	1 (line 1, line 2), 2 (total)
	The minimum number of trains	153 (line 1), 136 (line 2), 289 (total)
	The maximum number of trains	180 (line 1), 160 (line 2), 340 (total)
	The start time of the time period	1 (line 1, line 2)
	The end time of the time period	2100 (line 1, line 2)
	The capacity of each train	2016 (line 1, line 2)
	The minimum headway of each train (min)	4 (line 1, line 2)
	The maximum headway of each train (min)	10 (line 1, line 2)
	The essential cycle time of each connection (min)	112 (line 1), 111 (line 2)
	The length of each time slice (min)	0.5
	The unit operation cost of each train (CNY)	852 (line 1), 834 (line 2)
	The unit depreciation cost of each rolling stock (CNY)	3696 (line 1, line 2)
	The unit penalty time of each finally stranded passenger (min)	1000