Algorithm Engineering of Timetable Information

author: Matthias Müller-Hannemann, Martin-Luther University
published: Oct. 2, 2012,   recorded: September 2012,   views: 252
Categories

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

How to find attractive connections in public transportation for a planned trip is a challenging multi-criteria search problem which appears in several variants: as a pre-trip planning problem as well as an on-line problem. We give an overview of models and efficient algorithms for (optimally) solving timetable information problems in several realistic settings.

In daily operation, public transport always deviates from the planned schedule to a certain extent. Primary initial delays may cause a whole cascade of secondary delays of other trains, buses, planes, or the like over the entire network. This highly dynamic nature of the problem requires efficient update procedures. The inherent uncertainty about the development of delays asks for a stochastic view and requires methods for forecasting the delay development. We also survey recent results on robust pre-trip route planning. Finally, we close with some challenges for future research.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: