Train Schedule Optimization in Public Rail Transport

U. T. Zimmermann and T. Lindner ()
Additional contact information
U. T. Zimmermann: Braunschweig University of Technology, Department of Mathematical Optimization
T. Lindner: Braunschweig University of Technology, Department of Mathematical Optimization

A chapter in Mathematics — Key Technology for the Future, 2003, pp 703-716 from Springer

Abstract: Abstract Attractive train schedules are quite important for the success of public rail transport. We consider schedules which are repeated after some fixed time period. Periodicity is a well accepted, convenient attribute of all major railroad systems. Since trains share the public railroad network, we have to handle many conflicting demands. Increasing competition from transportation alternatives as well as the politically motivated process of deregulation forces railroad companies to reduce cost and resource utilization. In this situation, better decision tools are quite welcome. Here, we discuss models and corresponding methods for cost optimal train scheduling in real world railroad networks.

Keywords: Mixed Integer Linear Programming; Feasible Schedule; Railroad Network; Mixed Integer Linear Programming Model; Railroad Company (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:sprchp:978-3-642-55753-8_53

Ordering information: This item can be ordered from
http://www.springer.com/9783642557538

DOI: 10.1007/978-3-642-55753-8_53

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().