单线列车运行调整的梯度搜索算法仿真与研究  

Simulation and Study of Gradient Search Algorithm of Single-track Railway Rescheduling

作　　者：章优仕[1] 金炜东[1] 

机构地区：[1]西南交通大学电气工程学院,成都610031

出　　处：《系统仿真学报》2010年第11期2496-2501,共6页Journal of System Simulation

摘　　要：列车运行调整的优化是一个非常复杂的问题,需考虑的因素很多,很难给出一个完美的优化模型。根据单线列车运行调整的特点,建立了单线列车运行图的离散事件拓扑图模型,提出了"调整运行图综合满意度"作为运行调整的目标,并进一步论证了"调整运行图综合满意度"函数的单调递减特性;提出了冲突树的概念和梯度搜索算法的算法原理及搜索步骤,并实例进行仿真。仿真结果表明,该算法模型在实际运行过程中的具有较好的优化性和有效性。The optimization of railway rescheduling is a very complex issue, many factors should to be taken into account, and it’s difficult to give a perfect optimization model. A discrete event topologic diagram model was derived according to the characteristics of the single-track railway diagram, and the ＂comprehensive satisfaction of the adjusted train diagram＂ was proposed as the target of the railway rescheduling, then the monotonically decreasing characteristic of the target function was demonstrated. The concept of conflict tree was developed and the principle and steps of the gradient search algorithm based on the DET model were given and simulated. The simulation results show that this algorithm has better adaptability and effectiveness in practical application.

关 键 词：列车运行调整 调整运行图综合满意度 冲突树 梯度搜索算法 

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