Robust train speed trajectory optimization: A stochastic constrained shortest path approach

被引:19
|
作者
Wang, Li [1 ]
Yang, Lixing [2 ]
Gao, Ziyou [2 ]
Huang, Yeran [2 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Modern Post, Beijing 100876, Peoples R China
[2] Beijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing 100044, Peoples R China
关键词
train speed trajectory optimization; railway operation; stochastic programming;
D O I
10.15302/J-FEM-2017042
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Train speed trajectory optimization is a significant issue in railway traffic systems, and it plays a key role in determining energy consumption and travel time of trains. Due to the complexity of real-world operational environments, a variety of factors can lead to the uncertainty in energy-consumption. To appropriately characterize the uncertainties and generate a robust speed trajectory, this study specifically proposes distance-speed networks over the inter-station and treats the uncertainty with respect to energy consumption as discrete sample-based random variables with correlation. The problem of interest is formulated as a stochastic constrained shortest path problem with travel time threshold constraints in which the expected total energy consumption is treated as the evaluation index. To generate an approximate optimal solution, a Lagrangian relaxation algorithm combined with dynamic programming algorithm is proposed to solve the optimal solutions. Numerical examples are implemented and analyzed to demonstrate the performance of proposed approaches.
引用
收藏
页码:408 / 417
页数:10
相关论文
共 50 条
  • [31] A Reference Point Approach for the Resource Constrained Shortest Path Problems
    Pugliese, Luigi Di Puglia
    Guerriero, Francesca
    TRANSPORTATION SCIENCE, 2013, 47 (02) : 247 - 265
  • [32] An Optimized Genetic Routing Approach for Constrained Shortest Path Selections
    Poonriboon, Chatchai
    So-In, Chakchai
    Arch-Int, Somjit
    Rujirakul, Kanokmon
    2014 FOURTH INTERNATIONAL CONFERENCE ON DIGITAL INFORMATION AND COMMUNICATION TECHNOLOGY AND IT'S APPLICATIONS (DICTAP), 2014, : 226 - 230
  • [33] A HEURISTIC APPROACH TO HARD CONSTRAINED SHORTEST-PATH PROBLEMS
    RIBEIRO, CC
    MINOUX, M
    DISCRETE APPLIED MATHEMATICS, 1985, 10 (02) : 125 - 137
  • [34] A Personalized Urban Multicriteria Shortest Path Stochastic Optimization Algorithm
    Gong Bowen
    Lin Ciyun
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2015, 2015
  • [35] PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
    Csaji, Balazs Csanad
    Jungers, Raphael M.
    Blondel, Vincent D.
    ALGORITHMIC LEARNING THEORY, ALT 2010, 2010, 6331 : 89 - 103
  • [36] A hybrid stochastic approach for offline train trajectory reconstruction
    Pier Giuseppe Sessa
    Valerio De Martinis
    Axel Bomhauer-Beins
    Ulrich Alois Weidmann
    Francesco Corman
    Public Transport, 2021, 13 : 675 - 698
  • [37] A hybrid stochastic approach for offline train trajectory reconstruction
    Sessa, Pier Giuseppe
    De Martinis, Valerio
    Bomhauer-Beins, Axel
    Weidmann, Ulrich Alois
    Corman, Francesco
    PUBLIC TRANSPORT, 2021, 13 (03) : 675 - 698
  • [38] Cartesian Constrained Stochastic Trajectory Optimization for Motion Planning
    Dobis, Michal
    Dekan, Martin
    Sojka, Adam
    Beno, Peter
    Duchon, Frantisek
    APPLIED SCIENCES-BASEL, 2021, 11 (24):
  • [39] On the speed of convergence of value iteration on stochastic shortest-path problems
    Bonet, Blai
    MATHEMATICS OF OPERATIONS RESEARCH, 2007, 32 (02) : 365 - 373
  • [40] The Constrained Reliable Shortest Path Problem in Stochastic Time-Dependent Networks
    Russ, Matthias
    Gust, Gunther
    Neumann, Dirk
    OPERATIONS RESEARCH, 2021, 69 (03) : 709 - 726