Optimization of Metro Trains Operation Plans Based on Passenger Flow Data Analysis

Algorithm 2

Reduce.

	Input: < key, value>pair, where the key is the best individual in each population, and the value is the best fitness in each population.
	Output: < key′, value′>pair, where key′ is the ideal individual in all populations, and value′ is the best fitness in all optimal individuals of the population.
	Algorithm Procedure:
(1)	Identify the number of population N;
(2)	For i = 1 to N:
	Find maximum fitness;
	End For
(3)	Output the chromosome and fitness;