Note
Stochastic Programming Model for Allocation of Running Time Supplements
2016 Volume 26 Issue 3 Pages 307-317
Details
2016 Volume 26 Issue 3 Pages 307-317
Abstract. We consider the allocation of a running time supplement to a railway timetable. Previously, Vekas et al. developed a stochastic programming model. In this paper, their optimization model is improved by adding bound constraints on the supplements. It is shown that the probability of delays decreases when using the proposed model. In addition, an effective L-shaped algorithm is presented.
