动车组交路计划编制相关问题研究

发布时间：2018-03-06 13:08

本文选题：客运专线　切入点：动车组交路计划　出处：《兰州交通大学》2017年硕士论文　论文类型：学位论文

【摘要】：动车组是铁路运输旅客的重要工具,随着我国高速铁路网的不断建设,动车组的运行范围将进一步扩大。而动车组购置成本高,检修费用昂贵,在铁路基础建设投资和以后的运营成本中占较大比重,提高动车组运用效率、合理安排动车组的检修直接关系到铁路的经济效益。所以,作为铁路运输组织的重要计划之一的动车组交路计划的编制研究具有重要意义。本文在研究国内外相关文献的基础上,总结了既有研究中存在的问题,介绍了动车组交路计划的含义,分析了动车组交路计划和动车组运用计划之间的关系,对影响动车组交路计划编制的因素进行了的探讨并对动车组运用方式和检修模式进行了详细的叙述,然后对动车组交路计划的常用建模方法进行梳理,为动车组交路计划编制优化理清思路。将动车组交路计划编制问题归纳为一种特殊的旅行商问题。在列车运行图已知的情况下,借鉴经典旅行商的建模方法,确定了以动车组运用、列车运行线唯一接续、一级检修、运用和检修关联、剔除列车运行线接续子回路为约束,以动车组运用交路数量最少和列车运行线总的接续时间最短为目标函数的多约束、多目标函数的动车组交路计划编制模型,并针对模型中较难解决的整数规划问题和多目标问题进行了分析和处理。通过对求解旅行商问题的常用算法进行比较分析,确定了使用遗传算法对该模型进行求解,对遗传算法的基本理论进行介绍,包括遗传算法的解编码、初始种群、适应度函数、选择算子、交叉算子、变异算子,并结合动车组交路问题特点,对遗传算法中选择算子、交叉算子、变异算子等进行了改进设计。最后以武深高速铁路为算例对改进算法进行了验证,并与模拟退火算法和人工编制方法进行了对比,结果表明了改进算法的在编制动车组交路问题上有一定的高效性和实用性。
[Abstract]:EMU is an important tool for railway passenger transportation. With the continuous construction of high-speed railway network in China, the operating range of EMU will be further expanded. It takes a large proportion in the investment of railway infrastructure construction and the operation cost in the future. Improving the efficiency of EMU operation and arranging the maintenance of EMU reasonably are directly related to the economic benefit of railway. As one of the important plans of railway transportation organization, it is of great significance to study the preparation of the EMU traffic plan. On the basis of studying the relevant literature at home and abroad, this paper summarizes the problems existing in the existing research. This paper introduces the meaning of the EMU traffic plan, analyzes the relationship between the EMU traffic plan and the EMU operation plan. This paper discusses the factors that affect the preparation of EMU traffic plan, and describes in detail the mode of operation and maintenance of EMU, and then combs the common modeling methods of EMU traffic planning. In this paper, the train of mind is optimized for the preparation of the traversing plan of the EMU. The problem of the planning of the crossroad of the EMU is summed up as a special traveling salesman problem. When the train diagram is known, the modeling method of the classical traveller is used for reference. It is determined that the operation of the EMU, the unique continuity of the train running line, the connection of the first level overhaul, the application and the maintenance, and the elimination of the train running line continuous sub-loop are the constraints. Taking the minimum number of intersections and the shortest total connecting time of train running line as the multi-constraint of the objective function, the multi-objective function is used to compile the model of the crossroad planning of the EMU. The integer programming problem and multi-objective problem which are difficult to solve in the model are analyzed and dealt with. Through the comparison and analysis of the common algorithms for solving the traveling salesman problem, the genetic algorithm is used to solve the model. This paper introduces the basic theory of genetic algorithm, including the coding of genetic algorithm, initial population, fitness function, selection operator, crossover operator, mutation operator. The crossover operator, mutation operator and so on are improved. Finally, the improved algorithm is verified by taking Wu-Shen high-speed railway as an example, and compared with simulated annealing algorithm and artificial programming method. The results show that the improved algorithm has high efficiency and practicability in compiling EMU intersection problem.
【学位授予单位】：兰州交通大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：U292.6;TP18

【参考文献】