Table of Contents Author Guidelines Submit a Manuscript
Volume 2017 (2017), Article ID 3717654, 14 pages
Research Article

Application of Multiple-Population Genetic Algorithm in Optimizing the Train-Set Circulation Plan Problem

1Department of Transportation Management Engineering, School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China
2Ministry of Education (MOE) Key Laboratory for Urban Transportation Complex System Theory and Technology, School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China
3Department of Civil, Environmental, and Infrastructure Engineering, Volgenau School of Engineering, George Mason University, Fairfax, VA, USA
4Center for Advanced Transportation System Simulation, Department of Civil Environment Construction Engineering, University of Central Florida, Orlando, FL, USA

Correspondence should be addressed to Leishan Zhou

Received 2 January 2017; Revised 5 April 2017; Accepted 28 May 2017; Published 2 July 2017

Academic Editor: Jose Egea

Copyright © 2017 Yu Zhou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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-sets must conduct maintenance 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, and many factors such as the utilization mode and the maintenance mode 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 high-speed 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.