Application of multiple-population genetic algorithm in optimizing the train-set circulation plan problem

The train-set circulation plan problem (TCPP) belongs to the rolling stock scheduling (RSS) problem and is similar to the aircraft routing problem (ARP) in airline operations and the vehicle routing problem (VRP) in the logistics field. However, TCPP involves additional complexity due to the maintenance constraint of train-sets: train-setsmust conductmaintenance tasks after running for a certain time and distance. The TCPP is nondeterministic polynomial hard (NP-hard). There is no available algorithm that can obtain the optimal global solution, andmany factors such as the utilization mode and the maintenancemode impact the solution of the TCPP. This paper proposes a train-set circulation optimization model to minimize the total connection time and maintenance costs and describes the design of an efficient multiple-population genetic algorithm (MPGA) to solve this model. A realistic highspeed railway (HSR) case is selected to verify our model and algorithm, and, then, a comparison of different algorithms is carried out. Furthermore, a new maintenance mode is proposed, and related implementation requirements are discussed.