Abstract: In this paper, passenger dedicated line capacity is studied based on the timetable saturation, which is characterized as an integer programming model. To solve this problem, OD types are inserted one by one according to the OD bonus values from small to large. In each step, a random stop from all the stop types of the currently inserted OD type is selected and repeatedly iterated at each valuable inserting time. And the better saturation result can be obtained by combining all the iteration results. Finally, the .〖KG-*4〗net based timetable saturation application system is established, and the Wu-Guang passenger dedicated line timetable is used to verify the saturation method. Combined result and the best iteration result are compared to verify the combined optimization algorithm.

Key words: railway transportation, capacity, timetable saturation, passenger dedicated line

摘要： 通过对运行图进行加密来研究客运专线的能力问题，并将加密问题构建为整数规划模型进行求解. 为了求解这个问题，按照OD类型奖励值从大到小每次加密一种OD类型进行分步加密，在每一步中在每个可行时间点处随机选择属于该OD类型的所有停站方式中任意一个停站方式进行多次迭代加密，然后通过将多次迭代的结果组合优化得到较优的加密结果. 最后，构建了基于.net的运行图加密应用系统，并对武广客运专线的运行图进行了实例加密，通过比较组合优化与多次迭代最优的加密结果，验证了组合优化算法的可行性.

关键词: 铁路运输, 能力, 运行图加密, 客运专线