首页|期刊导航|铁道科学与工程学报|突发扰动下铁路技术站进路动态优化调整方法研究

突发扰动下铁路技术站进路动态优化调整方法研究OA

Optimization method for routes dynamic adjustment at railway technical station under sudden disturbance

中文摘要英文摘要

为解决人工选排进路或者计算机一次性选排进路无法应对突发扰动,造成安全压力大和运行效率低的问题,以突发扰动发生时进路方案快速调整、调整前后方案延续性最好为目标,提出一种铁路技术站进路动态优化调整方法.首先,通过建立信号机、道岔和轨道区段的图元模型,精细化描述铁路车站站场网络拓扑图,分析了作业计划、作业任务与进路三者之间的关系和扰动事件对作业和进路的影响.然后,基于t时刻的进路方案、扰动信息和作业计划,综合考虑任务执行时序、进路占用冲突和联锁表等约束,以任务延误时间最小、进路调整总数最少为目标,构建了铁路技术站进路动态调整0-1整数规划模型.其次,设计基于邻域搜索的遗传算法,快速计算得到t+1时刻调整后的可执行进路方案.最后,依据某技术站实际数据设计算例对模型的有效性和算法的高效性进行验证.结果表明,调整后的进路方案消除了由扰动引起的进路冲突,避免了扰动事件对作业造成的延误,恢复了车站正常的运行与作业秩序,并很好地继承了之前的方案,使得进路方案整体延续性最好.基于邻域搜索的遗传算法能够在迭代45次左右求得满意解,与传统遗传算法相比,本算法收敛速度更快,求得满意解的效率更高.研究结果为调度与控制一体化下铁路技术站作业计划的自动执行能提供理论支撑.

To solve the problem of high safety pressure and low operational efficiency caused by the inability of manual route selection or computer one-time route selection to cope with the impact of sudden disturbance events.With the goal of quickly adjusting the route plan during sudden disturbance and achieving the best continuity of the plans before and after adjustment,a dynamic optimization adjustment method for railway technical station routes was proposed.Firstly,by establishing the primitive model of signal,turnout and track section,the network topology of railway station yard was described in detail.The relationship among operation plan,operation task and route and the influence of disturbance on operation and route were analyzed.Then,based on the route scheme,disturbance information and operation plan at time t,considering the constraints of activity execution sequence,route occupation conflict and interlocking table,and aiming at minimizing the delay time of tasks and the total number of route adjustments,a 0-1 integer programming model for the dynamic adjustment of the routes of the railway technical station was constructed.Secondly,a genetic algorithm based on neighborhood search was designed to calculate the executable route scheme after t+1 time adjustment.Finally,based on the actual data from a certain technical station,a calculation example was designed to verify the effectiveness of the model and the efficiency of the algorithm.Some conclusions are drawn as follows.The adjusted route scheme can eliminate the route conflict caused by disturbance,avoid the delay caused by interference to the operation,and restore the normal order of the station operation.The genetic algorithm based on neighborhood search can obtain the satisfactory solution in about 45 iterations.Compared with traditional genetic algorithms,this algorithm has a faster convergence speed and higher efficiency in obtaining the satisfactory solution.The research results can provide theoretical support for the automatic execution of railway technical station operation plans under the integration of scheduling and control.

马亮;郭进

西南交通大学 信息科学与技术学院,四川 成都 611756||运营安全保障铁路行业工程研究中心,四川 成都 611756||四川省列车运行控制技术工程研究中心,四川 成都 611756西南交通大学 信息科学与技术学院,四川 成都 611756||运营安全保障铁路行业工程研究中心,四川 成都 611756

交通工程

铁路技术站进路调整0-1整数规划邻域搜索遗传算法

railway technical stationroute adjustment0-1 integer programmingneighborhood searchgenetic algorithm

《铁道科学与工程学报》 2026 (7)

3163-3177,15

中国国家铁路集团有限公司科技研究开发计划课题(P2024X003)中国铁道科学研究院集团有限公司科研开发基金资助项目(2022YJ217)

10.19713/j.cnki.43-1423/u.T20251532

评论