首页> 外文会议>World congress on intelligent transport systems >Optimization of train running profile on the basis of pruning algorithm
【24h】

Optimization of train running profile on the basis of pruning algorithm

机译:基于修剪算法的列车运行曲线优化

获取原文

摘要

We propose the method for optimizing train running profile on the basis of pruning algorithm. Optimizing train running profile which minimizes total energy consumption provides the fundamentals for practical operation of train control. To obtain optimal train running profile in many previous works, this problem is formulated as optimal control problem with some constraints (fixed origin and destination, stipulated running time, limited electric power, limited velocity and so on) and is adopted the numerical methods for calculus of variations, Pontryagin's principle, dynamic programming, Markov decision process and so on. Especially, previous work utilizing dynamic programming is useful for optimizing train running profile under the complicated conditions. However, this algorithm requires much time to be used in practical situation. Therefore, we developed the algorithm for optimizing train running profile under the same complicated condition within a little time scale.
机译:在修剪算法的基础上,提出了一种优化列车运行状况的方法。优化列车运行曲线以最大程度地减少总能耗,为列车控制的实际操作提供了基础。为了在许多先前的工作中获得最佳的列车运行曲线,将此问题表述为具有一定约束(固定的出发地和目的地,规定的运行时间,有限的电力,有限的速度等)的最佳控制问题,并采用了微积分的数值方法。变化,庞特里亚金原理,动态规划,马尔可夫决策过程等。特别地,利用动态编程的先前工作对于优化复杂条件下的列车运行曲线是有用的。但是,该算法在实际情况下需要花费大量时间。因此,我们开发了在相同复杂条件下短时间内优化列车运行曲线的算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号