We present a novel optimization approach for the timetabling problem of a railway company, i.e. scheduling of a set of trains, not violating track capacity constraints, so as to obtain a profit maximizing timetable. The scheduling decisions are based on estimates of the value of running different types of service at specified times. We have used a Lagrangian relaxation approach, in which the track capacity constraints are relaxed and assigned prices, so that the problem separates into one dynamic program for each physical train. The approach has been tested on a realistic example suggested by the Swedish National Railway Administration (Banverket). This example contains 18 passenger trains and 8 freight trains to be scheduled during a day on a stretch of single track and consisting of 17 stations.
Railway Timetabling Using Lagrangian Relaxation
1996
21 pages
Report
No indication
English
Railroad Transportation , Railroads , Conflict , Scheduling , Optimization , Railroad tracks , Railroad terminals , Railroad stations , Passenger transportation , Freight transportation , Rail transportation , Capacity , Integer programming , Lagrangian functions , Algorithms , Foreign technology , Timetables
Railway Timetabling using Lagrangian Relaxation
Online Contents | 1998
|Railway Timetabling using Lagrangian Relaxation
British Library Online Contents | 1998
|Transportation Research Record | 2023
|