Publikationstyp: Konferenz: Sonstiges
Art der Begutachtung: Keine Angabe
Titel: Conflict-free train scheduling in a compensation zone exploiting the speed profile
Autor/-in: Caimi, Gabrio
Fuchsberger, Martin
Burkolter, Dan
Herrmann, Thomas
Wüst, Raimond
Roos, Samuel
Tagungsband: RailZurich 2009 : 3rd International Seminar on Railway Operations Modelling and Analysis. Book of abstracts
Angaben zur Konferenz: 3rd International Conference on Railway Operations Modelling and Analysis (RailZurich2009), Zurich, 11-13 February 2009
Erscheinungsdatum: 2009
Verlag / Hrsg. Institution: ETH Zurich
Verlag / Hrsg. Institution: Zurich
Sprache: Englisch
Schlagwörter: Speed profile optimisation; Speed profile generation; Conflict-free train scheduling; Capacity constraints
Fachgebiet (DDC): 
Zusammenfassung: This paper addresses the problem of scheduling trains in compensation zones of the railway network, which connect main stations and where traffic is less dense. Thus, reserve times can be added to the trip times to be able to cope with delays. The times when trains enter and leave the zone are assumed to be given. The problem is then to find a track path for each train such that the timetable is conflict-free. Additionally, speed profiles should be chosen in a way that they minimise energy consumption and that most reserve times are placed towards the end of the trip to retain re-scheduling flexibility during operations. To solve the problem, the compensation zone is first divided into a small number of segments. For each train trip, the total available reserve time is computed and discretised into a number of time units. Speed profiles are then created by the distribution of these time units over the segments, resulting in a variety of alternative speed profiles. Finally, each speed profile receives a target function value considering energy consumption and reserve time placement. A graph theoretical approach is applied to find a set of conflict-free track paths that maximise the target function. By building cliques of track paths which block track resources simultaneously, tight restrictions for the ILP formulation are built. Results show that track paths can be built and assigned to several trains in half a minute.
Weitere Angaben: Abstract
Volltext Version: Publizierte Version
Lizenz (gemäss Verlagsvertrag): Lizenz gemäss Verlagsvertrag
Departement: School of Engineering
Organisationseinheit: Institut für Datenanalyse und Prozessdesign (IDP)
Enthalten in den Sammlungen:Publikationen School of Engineering

Dateien zu dieser Ressource:
Es gibt keine Dateien zu dieser Ressource.
Zur Langanzeige

Alle Ressourcen in diesem Repository sind urheberrechtlich geschützt, soweit nicht anderweitig angezeigt.