By considering various stochastic disturbances unfolding in a real-time dispatching environment, this paper develops a stochastic optimization formulation for incorporating segment travel-time uncertainty and dispatching policies into a medium-term train-timetabling process that aims to minimize the total trip time in a published timetable and reduce the expected schedule delay. Based on a heuristic sequential solution framework, this study decomposes the robust timetabling problem into a series of subproblems that optimize the slack-time allocation for individual trains. A number of illustrative examples are provided to demonstrate the proposed model and solution algorithms using data collected from a Beijing-Shanghai high-speed rail corridor in China.
Stochastic Optimization Model and Solution Algorithm for Robust Double-Track Train-Timetabling Problem
IEEE Transactions on Intelligent Transportation Systems ; 11 , 1 ; 81-89
2010-03-01
259791 byte
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Springer Verlag | 2018
|Robust Train Timetabling Problem: Mathematical Model and Branch and Bound Algorithm
Online Contents | 2012
|