基于速度距离网络的列车运行曲线优化  

Train trajectory optimization based on a speed-distance network

作　　者：王义惠[1] 朱松巍 刘硕 于柯[2] 宿帅 WANG Yihui;ZHU Songwei;LIU Shuo;YU Ke;SU Shuai(State Key Lab of Rail Traffic Control Safety,Beijing Jiaotong University,Beijing 100044,China;Beijing Subway Operation Co.,Ltd.,Beijing 100044,China)

机构地区：[1]北京交通大学轨道交通控制与安全国家重点实验室,北京100044 [2]北京市地铁运营有限公司,北京100044

出　　处：《北京交通大学学报》2020年第2期36-43,共8页JOURNAL OF BEIJING JIAOTONG UNIVERSITY

基　　金：国家自然科学基金(61503020);北京市地铁运营有限公司地铁运营技术研发中心项目(I19L00060)。

摘　　要：轨道交通的节能研究在环保与经济方面具有重要的意义.以最小化单列车运行过程中产生的能耗为目标,基于列车的非线性动力学模型构建离散的速度距离网络,将列车运行曲线优化问题转化为一个整数规划问题,采用拉格朗日松弛和最短路径算法优化列车运行曲线.在此基础上,提出在粗粒度网络最优解的小邻域内重构细粒度的速度距离网络的方法,可有效提高运算速度.基于北京地铁亦庄线的线路和车辆数据,设计仿真案例对上述算法进行评估,并与遗传算法、基于CPLEX的整数规划算法和混合整数规划算法的求解效果进行对比.结果表明:提出的基于速度距离网络的求解算法可生成能耗更优且误差较小的列车速度曲线,并精准满足运行时间与终点速度约束.The research on energy-efficiency in rail transit systems is of great significance in environmental protection and economy.To minimize operational energy consumption,a nonlinear dynamic model for the train’s operation is presented to build a discrete speed-distance network.The optimization problem is formulated as a integer linear problem,which is solved by Lagrangian Relaxation(LR)and the shortest path algorithm.On this basis,a method of reconstructing a fine-grained network in the neighborhood of a coarse-grained network’s solution is adopted,which improves the operation speed effectively.Based on the line and vehicle data of Beijing Metro Yizhuang Line,a simulation case is designed to evaluate the above optimization algorithm,compared with the genetic algorithm,the integer linear programming and mixed integer linear programming algorithm based on CPLEX.The results show that the speed-distance network has less energy consumption and error,which contributes to satisfing the end time and the end speed constraints precisely.

关 键 词：交通信息工程及控制 城市轨道交通 列车运行曲线 速度距离网络 拉格朗日松弛 

分 类 号：U268.43[机械工程—车辆工程]