Abstract.
We consider the design of line plans in public transport at a minimal total cost. Both, linear and nonlinear 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.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bussieck, M., Lindner, T. & Lübbecke, M. A fast algorithm for near cost optimal line plans. Math Meth Oper Res 59, 205–220 (2004). https://doi.org/10.1007/s001860300332
Issue Date:
DOI: https://doi.org/10.1007/s001860300332