Cost optimal periodic train scheduling

Thomas Lindner () and Uwe Zimmermann ()

Mathematical Methods of Operations Research, 2005, vol. 62, issue 2, 295 pages

Abstract: For real world railroad networks, we consider minimizing operational cost of train schedules which depend on choosing different train types of diverse speed and cost. We develop a mixed integer linear programming model for this train scheduling problem. For practical problem sizes, it seems to be impossible to directly solve the model within a reasonable amount of time. However, suitable decomposition leads to much better performance. In the first part of the decomposition, only the train type related constraints stay active. In the second part, using an optimal solution of this relaxation, we select and fix train types and try to generate a train schedule satisfying the remaining constraints. This decomposition idea provides the cornerstone for an algorithm integrating cutting planes and branch-and-bound. We present computational results for railroad networks from Germany and the Netherlands. Copyright Springer-Verlag 2005

Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00186-005-0001-0 (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:62:y:2005:i:2:p:281-295

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

DOI: 10.1007/s00186-005-0001-0

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 ().