Railway Timetabling Using Lagrangian Relaxation

(creator_code:org_t)

Institute for Operations Research and the Management Sciences (INFORMS), 1998
1998
English.
In: Transportation Science. - : Institute for Operations Research and the Management Sciences (INFORMS). - 0041-1655 .- 1526-5447. ; 32:4, s. 358-369

Related links:: https://urn.kb.se/re...; show more...; https://doi.org/10.1...; show less...

Abstract Subject headings

We present a novel optimization approach for the timetabling problem of a railway company, i.e., scheduling of a set of trains to obtain a profit maximizing timetable, while not violating track capacity constraints. The scheduling decisions are based on estimates of the value of running different types of service at specified times. We model the problem as a very large integer programming problem. The model is flexible in that if allows for general cost functions. We have used a Lagrangian relaxation solution 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 number of dual variables is very large. However, it turns out that only a small fraction of these are nonzero, wh ich one may take advantage of in the dual updating schemes. The approach has been, tested on a realistic example suggested by the Swedish National Railway Administration. This example contains 18 passenger trains and 8 freight trains to be scheduled during a day on a stretch of single track, consisting of 17 stations. The computation times are rather modest and the obtained timetables are within a few percent of optimality.

By the author/editor: Brännlund, Ulf; Lindberg, Per Ol ...; Nou, Andreas; Nilsson, Jan-Eri ...

About the subject

NATURAL SCIENCES: NATURAL SCIENCES; and Mathematics; and Mathematical Ana ...

By the university: VTI - The Swedish National Road and Transport Research Institute

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.