基于拉格朗日松弛算法的列车运行图优化  

Train Working Diagram Optimization Based on Lagrange Relaxation Algorithm

作　　者：高耀辉 梁东岳 

机构地区：[1]太原理工大学数学学院,山西 晋中

出　　处：《应用数学进展》2024年第5期2484-2498,共15页Advances in Applied Mathematics

摘　　要：本文主要研究了列车运行图优化问题。在我们所研究的问题当中,根据单线轨道区间的特点,为了使列车保证经济效益同时也要合理地在规定时刻内运行,这就需要我们寻找一个优化的列车运行图。由于在铁路线上运行的列车种类很多导致速度要求也不尽相同,我们主要针对各种速度不同的列车运行图(即非平行运行图)进行展开研究。本文的主要工作是:一是为进一步深入研究该问题,提出了一类基于时–空图构建的列车非平行运行图优化模型;二是针对该模型我们设计相应的启发式拉格朗日松弛算法进行求解;三是通过数值实验对比了标准次梯度法和修正次梯度法的收敛情况。This paper mainly studies the optimization problem of train working diagram. In the problem we studied, according to the characteristics of the single track segment, in order to ensure the economic benefits of the train while running reasonably within the specified time, we need to find an optimized train working diagram. Because there are many types of trains running on the railway line, which lead to different speed requirements, we mainly study the train working diagrams with different speeds (i.e., non-parallel operation diagrams). The main contributions of this paper are as follows: firstly, in order to further study this problem, a kind of optimization model of non-parallel train operation graph based on time-space graph is proposed;secondly, we design the corresponding heuristic Lagrange relaxation algorithm to solve the model;thirdly, the convergence of the standard sub-gradient method and the modified sub-gradient method is compared by numerical experiments.

关 键 词：非平行运行图 单线区间 拉格朗日松弛 次梯度法 

分 类 号：U29[交通运输工程—交通运输规划与管理]