A Modulo Network Simplex Method for Solving Periodic Timetable Optimisation Problems

Karl Nachtigall () and Jens Opitz ()
Additional contact information
Karl Nachtigall: TU Dresden
Jens Opitz: TU Dresden

A chapter in Operations Research Proceedings 2007, 2008, pp 461-466 from Springer

Abstract: Abstract In the last 15 years periodic timetable problems had been found much interest in combinatorial optimization. The results presented in [5, 9, 2, 3, 6, 7, 1] are based on a periodic event scheduling model published by Serafini and Ukovich [10].

Keywords: Slack Time; Stop Activity; Timetable Optimisation; Period Tension; Timetable Problem (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (4)

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:oprchp:978-3-540-77903-2_71

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

DOI: 10.1007/978-3-540-77903-2_71

Access Statistics for this chapter

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