TY - JOUR
T1 - A branch-anc-cut approach for solving line planning problems
AU - van Hoesel, C.P.M.
AU - Goossens, J.H.M.
AU - Kroon, L.G.
PY - 2004/1/1
Y1 - 2004/1/1
N2 - 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.
AB - 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.
U2 - 10.1287/trsc.1030.0051
DO - 10.1287/trsc.1030.0051
M3 - Article
VL - 38
SP - 379
EP - 393
JO - Transportation Science
JF - Transportation Science
SN - 0041-1655
IS - 3
ER -