Multistage stochastic programming model for optimizing allocation of running time supplements
Access this Article
We consider the allocation of a running time supplement to a railway timetable. Previously, Vekas et al. examined the optimal way to allocate the running time supplement. The uncertain disturbances in a railway were modeled using random variables. In their model, it was assumed that there was an upper limit to the total supplement, but its allocation was not restricted. In this paper, we suggest an improvement to the previous model and present a new stochastic programming model in which there is a constraint on the running time supplement allocated to each trip to minimize the expected delay. Then a solution algorithm to solve the problem is developed. In the previous model, allocation of the running time supplement was biased because it was not allocated to all trips. We balance the amounts of supplements for trips by adding upper and lower bounds. The uctuations of the supplements for trips become small, and the probability of a delay decreases using our new model. Then the calculation times using the L-shaped algorithm and the former method solving a deterministic equivalent of large-scale problems are compared. It is shown that the large-scale problems can be solved effectively by using the L-shaped method.
- Journal of Advanced Mechanical Design, Systems, and Manufacturing
Journal of Advanced Mechanical Design, Systems, and Manufacturing 10(3), JAMDSM0043-JAMDSM0043, 2016
The Japan Society of Mechanical Engineers