A fast algorithm for near cost optimal line plans

Michael R. Bussieck (), Thomas Lindner () and Marco E. Lübbecke ()

Mathematical Methods of Operations Research, 2004, vol. 59, issue 2, 205-220

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. Copyright Springer-Verlag 2004

Keywords: Integer programming; Nonlinear integer programming; Cutting planes; Public transport; Line planning (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860300332 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:59:y:2004:i:2:p:205-220

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860300332

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().