A branch-anc-cut approach for solving line planning problems

C.P.M. van Hoesel, J.H.M. Goossens*, L.G. Kroon

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

357 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)379-393
JournalTransportation Science
Issue number3
Publication statusPublished - 1 Jan 2004


Dive into the research topics of 'A branch-anc-cut approach for solving line planning problems'. Together they form a unique fingerprint.

Cite this