大型复杂枢纽列流图的列流线排列优化算法

Train Flow Line Sorting Optimization Algorithm in Train Flow Diagram of Large-scale and Complex Railway Hub

根据铁路枢纽内车站、铁路线之间的拓扑关系,以及车站衔接方向节点间的横纵坐标关系,提出通道到发节点对集合概念和求解算法。针对车站衔接的铁路线多的新特点,根据列流线在车站对应的到达节点和出发节点之间的相互关系,提出列流线直行最内侧、始发最外侧、终到最外侧、到达节点“逆时针”和出发节点“顺时针”6条排列原则。基于列流线沿铁路线和通道内排列关系不变的2个假定条件,提出“通道法”排列优化思路,构建列流线排列优先权重求解算法和排列优化算法。以包含23座车站、衔接13个方向的上海铁路枢纽为例,对68条列流线进行排列优化,验证了算法的合理性和有效性。

According to the topological relationship between stations and railway lines in railway hub,as well as the abscissa and ordinate coordinate relationship between the nodes in the connection direction of stations,the definition of arrival-departure node pairs sets in passage and the solving algorithm are proposed.In view of the new characteristics of multiple railway lines connected by stations,and according to the correlation between the arrival nodes and the departure nodes corresponding to the train flow lines at the station,6 principles are proposed,including train flow line straight inner direction,departure outer direction,arrival outer direction,arrival nodes CCW(counterclockwise)and departure nodes CW(clockwise).Based on two assumptions that the arrangement of the train flow lines along the railway line and in the pathway remains unchanged,“pathway method”sorting optimization algorithm is proposed,further,the train flow line sorting prior weighting algorithm and sorting optimization algorithm are constructed.With the use of algorithm to design a train flow diagram for Shanghai railway hub which contains 23 stations and 13 directions and 68 train flow lines,the rationality and effectiveness of the algorithm are validated.