TU Berlin

Combinatorial Optimization & Graph Algorithms group (COGA)2003

COGA 5-Wheel

Page Content

to Navigation

Preprints 2003

A Fast Algorithm for Near Cost Optimal Line Plans
Citation key Report-043-2003
Author Michael R. Bussieck, Thomas Lindner, and Marco E. L\übbecke
Year 2003
Number 043
Note Appears in Math. Meth. Oper. Res.
Institution Technische Universität Berlin, Institut für Mathematik
Abstract We consider the design of line plans in public transport at a minimal total cost. Both, linear and non-linear integer programming are adequate and intuitive modeling approaches for this problem. We present a heuristic variable fixing procedure which builds on problem knowledge from both techniques. We derive and compare lower bounds from different linearizations in order to assess the quality of our solutions. The involved integer linear programs are strengthened by means of problem specific valid inequalities. Computational results with practical data from the Dutch Railways indicate that our algorithm gives excellent solutions within minutes of computation time.
Bibtex Type of Publication Preprint
Link to publication Download Bibtex entry


Quick Access

Schnellnavigation zur Seite über Nummerneingabe