关键词: 列车运行图, 自适应遗传算法, 编制算法, 循环布线, 冲突化解

Abstract: By studing the intercity train diagram generation problem, a model is built to describe its solution space, determine optimal traveling order of trains and minimum total train running time. New mutation operator and crossover operator are adopted, and a modified adaptive genetic algorithm is proposed. The algorithm adopts the two-dimensional coding form of “train-interval traveling order” which can firstly determine the traveling order of trains in each interval.The algorithm is combined with the principle of breadth-priority cyclic, which can schedule train through the step of “time determine, discovery conflict, solve it”, determine the arrival and departure time of the train at each station. And then, the adaptive genetic algorithm is used for global optimization to obtain the best solution. Experiments show that the adaptive mechanism can improve the performance of the algorithm, get the best traveling order of the trains faster,and obtain a train diagram effectively.
 

Key words: train diagram, adaptive genetic algorithm, drawing algorithm, cyclic drawing, conflict elimination