Genetic Algorithm-Based Particle Swarm Optimization Approach to Reschedule High-Speed Railway Timetables: A Case Study in China

Abstract

In this study, a mixed integer programming model is proposed to address timetable rescheduling problem under primary delays. The model considers timetable rescheduling strategies such as retiming, reordering, and adjusting stop pattern. A genetic algorithm-based particle swarm optimization algorithm is developed where position vector and genetic evolution operators are reconstructed based on departure and arrival time of each train at stations. Finally, a numerical experiment of Beijing-Shanghai high-speed railway corridor is implemented to test the proposed model and algorithm. The results show that the objective value of proposed method is decreased by 15.6%, 48.8%, and 25.7% compared with the first-come-first-service strategy, the first-schedule-first-service strategy, and the particle swarm optimization, respectively. The gap between the best solution obtained by the proposed method and the optimum solution computed by CPLEX solver is around 19.6%. All delay cases are addressed within acceptable time (within 1.5 min). Moreover, the case study gives insight into the correlation between delay propagation and headway. The primary delays occur in high-density period (scheduled headway closes to the minimum headway), which results in a great delay propagation.