铁路车站进路选择优化模型及求解算法的研究

Research on Model and Algorithm of Routing Schedules for Railway Stations

铁路车站进路选择是车站运输组织的基础,合理地安排车站内各项作业的运行进路及其排列时机有利于提高运输生产效率,节约生产成本。本文以一般技术站为背景,从数学规划的角度研究车站进路的自动选择方法。通过定义衔接点和承载点,建立了车站网络的描述方法。以作业晚点时间最短以及各进路的总走行时间最短为目标,以避免车站作业的时空交叉、满足作业计划要求为约束构建了车站进路选择的数学规划模型。利用进路选择和进路排列时间的映射关系,把进路选择模型转化成一个等价的0-1整数规划模型。针对模型的非线性特点,以模拟退火算法为基础,提出了适合求解进路选择模型的复合优化算法。通过算例验证了模型的正确性以及求解算法的有效性。

Station route choice is the foundation work in rail transportation. Reasonably arranging the running route of every operation in stations and the route setting time is favourable for improvement of the production efficiency and reduction of the production cost of the station. Against the background of a general technical station, this paper studies automatic station route choice from the angle of mathematical programming. By defining the joining node and carrying node, this paper proposes a new method of depicting the station network. The mathematical station route choice model is established to meet the operational plan, which takes the minimized operation delay and total route traveling time as the targets and avoids spatio-temporal interactions among train operation routes. Mapping between route choice and route setting time is employed to formulate the equiv- alent 0-1 integer programming model. In view of the nonlinear characteristics of the equivalent model, the simulated annealing algorithm is appropriately used to design the composite optimization algorithm to solve the station route choice problem. Both correctness of the proposed model and validity of the composite algorithm are proved by numerical examples.