A Branch-and-Cut Approach for Solving Railway Line-Planning Problems

Authors:
Jan-Willem Goossens;Stan van Hoesel;Leo Kroon
Affiliations:
-;-;-
Venue:
Transportation Science
Year:
2004

Citing 0
Cited 7

A Column-Generation Approach to Line Planning in Public Transport

Transportation Science
Robust line planning in case of multiple pools and disruptions

TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
MIPLIB 2003

Operations Research Letters
Line planning in public transportation: models and methods

OR Spectrum
GRASP algorithms for the robust railway network design problem

Journal of Heuristics
Service-Oriented Line Planning and Timetabling for Passenger Trains

Transportation Science
Finding delay-resistant line concepts using a game-theoretic approach

Netnomics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.