direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Preprints 2003

Symmetry for Periodic Railway Timetables
Zitatschlüssel Report-016-2003
Autor Christian Liebchen
Jahr 2003
Nummer 016
Notiz in Bert Gerards and Alberto Marchetti-Spaccamela (eds.): Proceedings of ATMOS 2003 Algorithmic Methods and Models for Optimization of Railways, Electronic Notes in Theoretical Computer Science 92 No. 1, Elsevier, 2003
Institution Technische Universität Berlin, Institut für Mathematik
Zusammenfassung Periodic timetabling for railway networks is usually modeled by the Periodic Event Scheduling Problem (PESP). This model permits to express many requirements that practitioners impose on periodic railway timetables. We discuss a requirement practitioners are asking for, but which, so far, has not been the topic of mathematical studies: the concept of symmetry. Several motivations why symmetric timetables might seem promising will be given. Though, we provide examples proving suboptimality of symmetric timetables, in general. There are many obstacles to overcome when trying to introduce symmetry into the graph model of the PESP. Nevertheless, adding symmetry requirements to mixed-integer programming formulations explicitly, enables MIP solvers, such as CPLEX, to terminate earlier with good solutions.
Typ der Publikation Preprint
Link zur Publikation Download Bibtex Eintrag