Article ID: | iaor20052243 |
Country: | United States |
Volume: | 38 |
Issue: | 3 |
Start Page Number: | 379 |
End Page Number: | 393 |
Publication Date: | Aug 2004 |
Journal: | Transportation Science |
Authors: | Kroon Leo, Hoesel Stan van, Goossens Jan-Willem |
Keywords: | programming: integer |
An important strategic phase in the planning process of a railway operator is the development of a line plan, i.e., a set of routes (paths) in a network of tracks, operated at a given hourly frequency. We consider a model formulation of the line-planning problem where total operating costs are to be minimized. This model is solved with a branch-and-cut approach, for which we develop a variety of valid inequalities and reduction methods. A computational study of five real-life instances based on examples from Netherlands Railways (NS) is included.