节点文献
高速铁路动车组运用计划编制理论与方法研究
Theory and Method Studies on EMU Scheduling Problem for High Speed Railway
【作者】 李华;
【导师】 韩宝明;
【作者基本信息】 北京交通大学 , 交通运输规划与管理, 2013, 博士
【摘要】 动车组运用计划是高速铁路客运组织过程中的关键环节,直接关系到列车运行安全、服务质量和经济效益。随着我国高速铁路的发展,动车组运用计划编制问题的相关特征呈现出多样化、复杂化趋势,对动车组运用计划的编制提出了新的要求。论文以高速铁路实际生产环境为基础,对动车组运用计划编制理论与方法进行研究。论文的主要工作及成果包括:1、对动车组运用计划编制基础进行了分析,总结出动车组运用计划编制问题具有时空跨度大、优化目标多、约束条件复杂等特点。2、将动车组运用计划编制问题归结为特殊的旅行商问题,提出了考虑检修线占用的动车组运用计划编制模型,采用“传递”机制设计了检修累计参数表达方法。为降低问题复杂度和求解难度,提出了从时间、空间和编制过程三个方面对问题进行分解的策略。策略中,将动车组运用计划分为交路计划和检修计划两个阶段分别进行编制。3、针对动车组交路计划,通过对不同场景条件下交路计划编制过程进行分解,总结出以“基本交路计划”为核心的编制过程。进而针对基本交路计划,提出了编制计划的整数规划模型,设计了求解模型的改进型粒子群算法;算法中,为提高粒子寻优能力,引进了动车组最优接续网络作为粒子飞行的参考;通过算例分析验证了方法的有效性。4、针对动车组检修计划,同样通过对不同场景条件下计划编制过程进行分解,将编制过程分解为运用修计划编制和高级修计划编制两个部分。针对运用修计划,提出编制计划的整数规划模型,设计了求解模型的改进型蚁群算法;算法中,增加运用任务对应的动车组走行里程作为蚂蚁路径选择概率的计算参数之一,提高了算法面向最大化修程利用率目标的寻优特性;通过算例验证了方法的有效性。
【Abstract】 Scheduling of Electric Multiple Units (EMU) is the keylink in the process of passenger transport organization of high-speed railway, and directly relates to the running safety of trains, the service quality, and the economic benefit. With the development of high-speed railway in our country, the characteristics of EMU scheduling problems present a trend of diversification and complication, so new requirements are put forward for the scheduling of EMU. Based on the actual production environment of the high-speed railway, this thesis carries out theory and method studies on the EMU scheduling problem. The main work and achievements can be summarized as follows:1. The basis of EMU scheduling problem is analyzed, and the characteristics of the EMU scheduling problem are concluded, including the wide range of time-space, the multiple optimization objective, and the complex constraints.2. The EMU scheduling problem comes down to one special class of travelling salesman problem. Learning from the modeling method of the typical travelling salesman problem, the EMU scheduling model considering the occupancy of maintenance linesis is put forward and the expression method of maintenance accumulative parameters is designed using the "delivering" mechanism. In order to reduce the complexity and the solving difficulty, the solution strategy is proposed, which decomposes the problem from the temporal, spatial and procedural aspects. In the strategy, the EMU scheduling problem is concretely decomposed into the circulation of EMU and the maintenance routing of EMU.3. For the circulation problem of EMU, the planning process with the core of simple circulation is built by decomposing the circulation programs in different scenarios. Then, for the basic circulation process, an integer programming model is presented and a modified solving algorithm is designed using the idea of particle swarm optimization. In order to improve the particle optimization ability, the optimum connecting network of EMU is introduced to be the reference to the particle flying. The proposed circulation planning method is tested and verified by an example.4. For the maintenance routing problem of EMU, the planning process is divided into two parts, the maintenance routing planning for the first and second levels and the maintenance routing planning for the high level, by decomposing the maintenance routing programs in different scenarios. For the maintenance routing planning of the first and second levels, an integer programming model is expressed and a modified ant colony optimization algorithm is designed to solve the model. The travel mileage and the travel time are added as parameters of calculating the probability of the ant routing choice, which improve the optimizing character of the algorithm for the target of maximizing the utilization of maintenance cycle mileage standard. The proposed maintenance routing planning method is also tested and verified by an example.