Research on the Formulation and Optimization of the
Operation Plan in Railway Section Station
Abstract: Section station is cut-off point of adjacent traction sections in railway network, and occupies the largest part of technical stations in China. Section station has an important position in railway organization system of our country. Although its system is relative small, its work is troublesome. It contains most of operations in marshalling station and intermediate station, including running organization, passenger transport and freight transport. Thus the level of operation organization of section station has an important influence on improving the capacity of the railway network and ensuring the railway transportation running smoothly.
With the application of the railway information network and computer centralized control system, automation is an inevitable trend for the operation of section station. At present, the automation of section station in our country is still in a low level and consequently the technology in this aspect is promising. The implement of intelligent decision making and automatic controling route for the station operation plan is the core of automation in section station. Then those aims, such as improving the efficiency of transportation operation, reducing the labor intensity of operators, and ensuring the safe of operation in railway station could be reached.
In this paper, we make a systematical and deep research on the formulation and optimization of operation plan in section station from the following aspects.
(1) Classification,tasks,main equipments,operation and information systems in section stations are analyzed. The technical operation process of freight trains in section station is analyzed with arrow network diagram. Analysis on the general technical operation process of various trucks is also made. The similarities and differences of technical operation and equipments between section station and marshalling station are also analyzed.
III
(2) On the basis of the analysis on the factors affecting the scheduling of the arrival-departure track operation, using the following conditions as our optimization goals: operating the arrival-departure tracks in accordance with the fixed operation scheme, and reducing the influence which the departing-receiving operations imposed on the shunting operations, we establish an integer programming model for formulating a track operation plan. By applying modern sequencing theory, it is transformed into a fixed sequencing model of special parallel machines. Then we design a heuristic algorithm to solve the model.
(3) Under the premise of trains meeting the requirements of punctuality and non-violating train formation rules, regarding reducing the number of trains cancelled and minimizing the trucks’ stay time as our objectives, under the analysis on constraints of truck flow connection, breaking-up, making-up, application of shunting locomotive, and so on, the linear programming model which combined traffic assignment with shunting locomotive operation plan is formulated. Under the background of a section station with only one shunting locomotive or with two shunting locomotives, the research on how to solve the model is carried out.
(4) We transformed the problems of taking-out only and placing-in only into the shortest circle problem in a Hamilton graph, and dynamic programming method, C-W saving algorithm improved, broken circle and connection method are applied to solve the model. The advantages and disadvantages of the three algorithms are compared by giving an example. The modified broken circle and connection method is applied to adapt to the other operation forms. It is pointed that rational placing-in and taking-out sequences are Hamilton circles which satisfy all priorities. A heuristic algorithm was designed to solve the form of placing-in, transferring, and taking-out combined. In order to adapt to the actual scene better, a multi-object model for wagons’ taking-out and placing-in in branch-shaped operation sites is formulated, and simulated annealing algorithm is applied to solve the problem.
(5) The structure of section station is analyzed, and topological structure of station is built. Based on the principle of depth first, a route
IV
search algorithm is proposed, and the route sets are obtained for selecting superior routes. A 0-1 mixed integer programming model is provided for optimization of route selection in section station. Simulated annealing algorithm is applied to solve the problem.
(6) In order to build the comprehensive automation system for section station, we analyzed the principles and objectives of integrated automation in section station. Based on integrating the existing information system in section station, the design framework of the comprehensive automation system in section station is put forward, and the function of each module is analyzed in detail. The coordinated formulation and feedback adjustment process of the station operation plan are also analyzed emphatically.
Keywords：railway section station, station operation plan, scheduling theory, graph theory, simulated annealing algorithm Classification: U292.13
V
目 录
1 绪论 ............................................................................................................................ 1 1.1 研究意义 ............................................................................................................. 1 1.2 国内外研究现状 ................................................................................................. 2 1.3 研究内容 ........................................................................................................... 12 2 铁路区段站技术作业分析 ...................................................................................... 15 2.1 我国区段站的大体情况 ................................................................................... 15 2.1.1 区段站的分类 ............................................................................................. 15 2.1.2 区段站的主要业务 ..................................................................................... 15 2.2.3 区段站的主要设备 ..................................................................................... 16 2.2.4 区段站行车信息及调度系统 ..................................................................... 17 2.2 区段站列车的技术作业过程分析 ................................................................... 18 2.2.1 区段站办理列车的种类 ............................................................................. 19 2.2.2 区段站列车技术作业过程分析 ................................................................. 20 2.3 区段站货车的技术作业过程分析 ................................................................... 22 2.3.1 区段站办理货车的种类 ............................................................................. 22 2.3.2 货车技术作业过程分析 ............................................................................. 22 2.4 区段站与编组站技术作业及设备的区别 ....................................................... 23 3 区段站到发线运用计划编制优化 .......................................................................... 25 3.1 模型的建立 ....................................................................................................... 26 3.1.1 目标函数 ..................................................................................................... 26 3.1.2 约束条件 ..................................................................................................... 28 3.2 求解方法 ........................................................................................................... 30 3.3 案例分析 ........................................................................................................... 32 3.4 本章小结 ........................................................................................................... 35 4 列车配流与调机运用计划综合编制优化 .............................................................. 36 4.1 问题描述 ........................................................................................................... 36 4.2 符号说明 ........................................................................................................... 37 4.3 模型建立 ........................................................................................................... 38 4.3.1 目标函数 ..................................................................................................... 38
VI
4.3.2 约束条件 ..................................................................................................... 39 4.3.3 技术作业时间参数的确定 ......................................................................... 46 4.4 求解方法 ........................................................................................................... 47 4.4.1 调机作业顺序已定的情况下的配流 ......................................................... 47 4.4.2 调机作业顺序的确定 ................................................................................. 50 4.4.2.1只配备一台调机的区段站 .................................................................. 50 4.4.2.2 配备两台调机的区段站 ..................................................................... 55 4.5 案例分析 ........................................................................................................... 57 4.6 本章小结 ........................................................................................................... 62 5 取送车作业计划编制优化 ...................................................................................... 63 5.1 问题描述 ........................................................................................................... 63 5.2 单一送（取）车 ............................................................................................... 64 5.2.1模型的建立 .................................................................................................. 64 5.2.2 求解方法 ..................................................................................................... 66 5.2.2.1 动态规划法 ......................................................................................... 66 5.2.2.2 C-W节约改进算法 ............................................................................. 66 5.2.2.3 破圈连接法 ......................................................................................... 67 5.2.3 案例分析 ..................................................................................................... 70 5.3送调取组合作业 ................................................................................................ 75 5.3.1 改进破圈连接法 ......................................................................................... 75 5.3.2 启发式算法 ................................................................................................. 76 5.3.3 案例分析 ..................................................................................................... 82 5.4 多目标取送车作业 ........................................................................................... 86 5.4.1 符号说明 ..................................................................................................... 86 5.4.2 目标函数分析 ............................................................................................. 87 5.4.3 约束条件 ..................................................................................................... 88 5.4.4 求解方法 ..................................................................................................... 89 5.4.5 案例分析 ..................................................................................................... 91 5.5 本章小结 ........................................................................................................... 92 6 车站作业进路的选择优化 ...................................................................................... 94 6.1 站场结构分析及拓扑结构图建立 ................................................................... 94 6.1.1 车站拓扑结构图的建立 ............................................................................. 95 6.1.2 节点坐标的确定 ......................................................................................... 95
VII
