A Branch-and-Cut approach for solving line planning problems
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...
|Keywords||branch and cut, combinational optimization, integer programming, rail transportation|
|Persistent URL||dx.doi.org/10.1287/trsc.1030.0051, hdl.handle.net/1765/6692|
Goossens, J.H.M., van Hoesel, S., & Kroon, L.G.. (2004). A Branch-and-Cut approach for solving line planning problems. Transportation Science, 38(3), 379–393. doi:10.1287/trsc.1030.0051