Abstract: Train-Set scheduling is one of the key technologies in traffic operation organization for high-speed railway. With reviewing the domestic and international correlative researches on high-speed train-set schedule and analyzing the circulating characters and the rules of high-speed train-set, the study developed an integer programming model based on the train diagram. It transformed connection and turnaround plans of train-sets into the traveling salesman problem (TSP) in a network, which contained several constraint conditions and objective functions. And then put forward the ant colony algorithm to solve the problem. It provides the effective algorithm of optimizing and using computer to workout the train-set scheduling of the high-speed or special passenger railway. Finally, the paper combines the Wuhan-Guangzhou Passenger Dedicated Line and use computer simulation to approve the feasibility and practicality of the algorithm.

Key words: train-set, scheduling, integer programming, ant colony algorithm

摘要： 动车组运用是高速铁路运输组织的关键技术之一.本文结合国内外对高速铁路动车组运用问题的相关研究，根据动车组的运用特点和运用规则，在已知列车运行图的基础上，建立了求解动车组运用问题的整数规划模型.将动车组的接续运行与检修计划制定过程转化为动车组运用网络上具有较多约束条件和目标函数的TSP问题.并借鉴了蚁群算法求解该问题.为优化我国在建和拟建的高速铁路和客运专线的动车组运用及计算机自动编制动车组运用计划提供了有效的求解算法.最后结合武广客运专线运用计算机模拟进行验算，证实了算法的可行性、实用性.

关键词: 动车组, 运用计划, 整数规划, 蚁群算法