Capacity Optimization of High-speed Railway Train in Established Schedule Plan Based on Improved ACO Algorithm

In order to improve the transporting ability of high-speed trains, Gave the definition of the minimizing departure interval between trains, and the definition of the drawing compact diagram without considering overtaking conditions. After considering the matching coefficient of train operation, an 0-1 integer programming model was established to maximize capacity of trains and convert the problem into an asymmetric traveling salesman problem (ATSP). Then a improved algorithm-ant colony optimazition(ACO) algorithm is designed to solve the problem. The case of Shanghai to Beijing high-speed trains were taken as an example solving by programming. Computation results show that considering the matching coefficient of train operation, the optimized scheme can shorten the total time by 219 min (about 28.52%) than the existing scheme.