A genetic algorithm for heterogeneous high-speed railway timetabling with dense traffic: The train-sequence matrix encoding scheme

Abstract

Recently, the continued growth of passenger demand for high-speed railways and expectations for varied types of train services have posed a great need for designing a railway timetable suitable for dense and heterogeneous train traffic, where train overtaking is necessary for proper capacity utilization. This study develops an efficient genetic algorithm that considers train orders in all sections to better depict train overtaking and impose specific operational rules essential in this context. Train-sequence matrix is chosen as the chromosome encoding, based on which the “exchange + regeneration” matrix crossover operator is innovatively designed that considers the heterogeneity among trains and improves the feasibility of the crossover, which previous one-sequence crossover operators cannot realize. An overtaking-oriented local search heuristic is inserted in the algorithm to facilitate the local improvement. To guarantee the feasibility of the final solution, a conflict resolution procedure with conflict impact area identification is introduced. Tests of the algorithm on several small- and medium-sized cases reveal that it can reach relatively good solutions within a short time. Finally, the algorithm is tested on Beijing-Shanghai high-speed railway corridor in China and presents good performance both in efficiency and quality.