1,305 Hits in 4.2 sec

Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time

Julian Dibbelt, Ben Strasser, Dorothea Wagner, Marc Herbstritt
2014 Algorithmic Approaches for Transportation Modeling, Optimization, and Systems  
We study the problem of computing delay-robust routes in timetable networks. Instead of a single path we compute a decision graph containing all stops and trains/vehicles that might be relevant.  ...  Delays are formalized using a stochastic model. We show how to compute a decision graph that minimizes the expected arrival time while bounding the latest arrival time over all sub-paths.  ...  We show some basic properties about the problem of computing a decision graph with minimum expected arrival time and give an optimal solution algorithm.  ... 
doi:10.4230/oasics.atmos.2014.1 dblp:conf/atmos/DibbeltSW14 fatcat:latdxxokgzehxeq5b6oljrajzq

Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past

Katerina Böhmová, Matúš Mihalák, Peggy Neubert, Tobias Pröger, Peter Widmayer, Marc Herbstritt
2015 Algorithmic Approaches for Transportation Modeling, Optimization, and Systems  
Given an urban public transportation network and historic delay information, we consider the problem of computing reliable journeys.  ...  In particular, if the past observations are typical, then the learning-based methods are able to produce solutions that perform well on typical days, even in the presence of large delays.  ...  We wish to thank the Verkehrsbetriebe Zürich (VBZ) for providing historic real-world delay data.  ... 
doi:10.4230/oasics.atmos.2015.68 dblp:conf/atmos/BohmovaMNPW15 fatcat:jlxc2gaverafdb7roek2mzjo3i

Robustness for a single railway line: Analytical and simulation methods

Miguel A. Salido, Federico Barber, Laura Ingolotti
2012 Expert systems with applications  
In the analytical approach, we have developed some formulas to measure robustness based on the study of railway line infrastructure topology and buffer times.  ...  These methods have been inserted in MOM 1 , which is a project in collaboration with the Spanish Railway Infrastructure Manager (ADIF).  ...  When the departure time of a train from a station of its journey has been delayed with respect to the original one, the re-scheduling process projects a new arrival time to the next station.  ... 
doi:10.1016/j.eswa.2012.05.071 fatcat:evtdja62ezhapicfoymmkzxseu

Intriguingly Simple and Fast Transit Routing [chapter]

Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner
2013 Lecture Notes in Computer Science  
Moreover, we extend it to handle the minimum expected arrival time (MEAT) problem, which incorporates stochastic delays on the vehicles and asks for a set of (alternative) journeys that in its entirety  ...  minimizes the user's expected arrival time at the destination.  ...  Minimum Expected Arrival Time In this section we aim to provide delay-robust journeys that offer sensible backup alternatives at every stop for the case that transfers fail.  ... 
doi:10.1007/978-3-642-38527-8_6 fatcat:o45rlxikynfazogindlpb4i42q

Connection Scan Algorithm [article]

Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner
2017 arXiv   pre-print
We additionally introduce the Minimum Expected Arrival Time (MEAT) problem to handle possible, uncertain, future vehicle delays. We present a solution to the MEAT problem that is based upon CSA.  ...  We present algorithm variants that only optimize the arrival time or additionally optimize the number of transfers in the Pareto sense.  ...  As further problem variant, we propose and study the minimum expected arrival time (MEAT) problem setting to compute delay-robust journeys.  ... 
arXiv:1703.05997v1 fatcat:zpk6yoyringi3diunskgpg5tx4

A microscopic evaluation of railway timetable robustness and critical points

Emma Solinen, Gemma Nicholson, Anders Peterson
2017 Journal of Rail Transport Planning & Management  
In a robust timetable, we also require that trains have the capability to recover from small delays and that the delays are kept from propagating over the network.  ...  A robust timetable should also be able to recover from small delays. With a more robust timetable railway traffic delays can be reduced and punctuality can be improved.  ... 
doi:10.1016/j.jrtpm.2017.08.005 fatcat:tyqwkk4a3vc7zdpz6tluh2qmwy

Is Timetabling Routing Always Reliable for Public Transport?

Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni, Marc Herbstritt
2013 Algorithmic Approaches for Transportation Modeling, Optimization, and Systems  
In this paper, we try to measure empirically the quality of the solutions offered by timetabling routing in a real public transport network, where unpredictable delays may happen with a certain frequency  ...  buses, subway trains) will incur in no delays throughout their trips.  ...  the GPS data used to track the transit vehicles in the transport network of Rome.  ... 
doi:10.4230/oasics.atmos.2013.15 dblp:conf/atmos/FirmaniILS13 fatcat:7zzoxwy6ynca3oeihvagjfizqm

Robustness as a Third Dimension for Evaluating Public Transport Plans

Markus Friedrich, Matthias Müller-Hannemann, Ralf Rückert, Alexander Schiewe, Anita Schöbel, Michael Wagner
2018 Algorithmic Approaches for Transportation Modeling, Optimization, and Systems  
For such an assessment we develop several passenger-oriented robustness tests which can be instantiated with parameterized delay scenarios.  ...  As one application we study the impact of different strategies to improve the robustness of timetables by insertion of supplement times.  ...  We expect that circulation time supplements become more important for delay scenarios with larger delay parameters.  ... 
doi:10.4230/oasics.atmos.2018.4 dblp:conf/atmos/FriedrichMRSS18 fatcat:oedriu5zg5frtf2k5hjirnd3ky

Multi-objective periodic railway timetabling on dense heterogeneous railway corridors

Fei Yan, Nikola Bešinović, Rob M.P. Goverde
2019 Transportation Research Part B: Methodological  
This paper proposes a new multi-objective periodic railway timetabling (MOPRT) problem with four objectives to be minimized: train journey time, timetable regularity deviation, timetable vulnerability  ...  The aim is to find an efficient, regular and robust timetable that utilizes the infrastructure capacity as good as possible.  ...  Special thanks to Gerben Scheepmaker and NS who provided the timetable data of the Dutch railway corridor.  ... 
doi:10.1016/j.trb.2019.05.002 fatcat:gqfxkbbbgrclxevebckxlavpzi

The Price of Robustness in Timetable Information

Marc Goerigk, Martin Knoth, Matthias Müller-Hannemann, Marie Schmidt, Anita Schöbel, Marc Herbstritt
2011 Algorithmic Approaches for Transportation Modeling, Optimization, and Systems  
The classic notion of strict robustness leads to the problem of identifying those changing activities which will never break in any of the expected delay scenarios.  ...  In this paper, we consider robust timetable information, i.e. we want to identify a path which will bring the passenger to the planned destination even in the case of delays.  ...  Figure 5 5 Light robustness: The increase of strict robust paths (in %, upper left), the increase in minimum slack times on the chosen light robust path in comparison with the nominal scenario (upper right  ... 
doi:10.4230/oasics.atmos.2011.76 dblp:conf/atmos/GoerigkKMSS11 fatcat:fqvjdqfxv5gyfbrh4o7shcg7wi

Computing delay resistant railway timetables

Christian Liebchen, Michael Schachtebeck, Anita Schöbel, Sebastian Stiller, André Prigge
2010 Computers & Operations Research  
We arrive at computing delay resistant timetables by selecting a new objective function which we design to be in the middle of the traditional simple timetabling objective and the sophisticated delay management  ...  In the past, much research has been dedicated to compute optimum railway timetables. A typical objective was the minimization of passenger waiting times.  ...  Acknowledgment We thank Jens Dupont, Robert Firla, and Frank Geraets, Deutsche Bahn AG, for inspiring parts of this research and for providing us with the data necessary to perform our case study.  ... 
doi:10.1016/j.cor.2009.03.022 fatcat:xf3eqcnpufbc5elzxgaojgoloy

Recoverable Robust Timetable Information

Marc Goerigk, Sacha Heße, Matthias Müller-Hannemann, Marie Schmidt, Anita Schöbel, Marc Herbstritt
2013 Algorithmic Approaches for Transportation Modeling, Optimization, and Systems  
In this work we propose a recoverable robust approach to timetable information; i.e., we aim at finding travel routes that can easily be updated when delays occur during the journey.  ...  Due to delays in the original timetable, in practice it often happens that the travel route cannot be used as originally planned.  ...  A standard way of doing timetable information is to search for a path with minimum travel time as primary objective and with minimum transfers as a secondary one.  ... 
doi:10.4230/oasics.atmos.2013.1 dblp:conf/atmos/GoerigkHMSS13 fatcat:wrwyv2vfcfgppc73akoh6oniju

Timetable stability - using simulation to ensure quality in a regular interval timetable [chapter]

J. Demitz, C. Hübschen, C. Albrecht
2010 Vorticity and Turbulence Effects in Fluid Structure Interactions  
The connection times are often short (generally less than 8 minutes). Therefore, there is a strong demand for a very good on time running in the network.  ...  A regular interval timetable is characterised by train services that run in a fixed pattern, e.g. every 60 minutes.  ...  timetable with extended scheduled dwell times In both scenarios the same delay distributions were used and the minimum dwell times were similar.  ... 
doi:10.2495/978-1-84564-500-7/02 fatcat:3t6jnapbtjhuzesh4pzac4z4mu

Resolving instability in railway timetabling problems

Nikola Bešinović, Egidio Quaglietta, Rob M. P. Goverde
2019 EURO Journal on Transportation and Logistics  
We propose a heuristic model to develop a stable timetable which maximises the satisfaction of transportation demand in situations where network capacity is limited.  ...  We develop a mixed integer linear programming (MILP) model for minimising the cycle time to find an optimised stable timetable for the given line plan.  ...  Acknowledgements The research has been supported by the Erasmus+ mobility grant and performed during the first author's visit to the UK infrastructure manager Network Rail.  ... 
doi:10.1007/s13676-019-00148-3 fatcat:sl6z2ricbzfstbosdomn5d7p7e

Evaluation of Train Crews Schedule in Terms of Robustness

Łukasz Wolniewicz
2019 Journal of KONBiN  
The problem of responding to delays in terms of reorganisation of work, prevention of delay propagation and real-time schedule changes is important.  ...  The study analysed the changes of the conductor's team to another train depending on the buffer time provided in work plan, real time needed for change and train delays.  ...  of the train, possible brake test, • the possible maximum duration of the journey, • the minimum duration of the journey, • time of departure, • time of arrival, • the maximum duration of work on a day  ... 
doi:10.2478/jok-2019-0004 fatcat:cs3plsjsrjhntk2kxfutbjzi7a
« Previous Showing results 1 — 15 out of 1,305 results