Institute of Theoretical Informatics, Algorithmics

Integrated Planning in Public Transport – DFG-Research Group FOR 2083

Overview

Timetable information systems (e.g. DB Navigator) and journey planners for road networks (e.g. Google-Maps- and Bing-Maps-Routeplanning or TomTom-navigation system) are some of the most used information systems. Nowadays, useres expect more extensive information than just the computation of fastest route. The possibility to find new or alternative routes as a response to current traffic conditions respectively delays is an obvious requirement for modern journey planning systems. Likewise it is a necessity to integrate different modes of transportation, such as intercity buses or car sharing as supplement for public transport.

In light of novel alternative mobility concepts, new information systems that provide “real” alternatives somewhere in between public and private transport will be expected in the future. Notable examples for this are the recent development of long distance bus lines, car sharing concepts like “Stadtmobil”, modern ride sharing services like flinc, or the bike and car rental offered by Deutsche Bahn. Furthermore, today's user expect not only a fastest route, but “best” routes with respect to their personal preferences.

Existing journey planning systems, such as the aforementioned ones, resolve these challenges only partially. However, current timetable information systems do not consider other modes of transportation throughout the whole journey, but at most for arriving and departing from public transport; thus no “truly” multimodal journeys are computed. Similarly, information concerning current delays is provided during the journey, but no real alternative routes incorporating current delays in the public transportation network are offered.

Participants

Project Websites

Publications

  1. Julian Dibbelt, Ben Strasser und Dorothea Wagner.
    Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time.
    In: Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'14), volume 42 of OpenAccess Series in Informatics (OASIcs), pages 1-14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, September 2014.
    [ pdf ]
  2. Spyros Kontogiannis, Dorothea Wagner und Christos Zaroliagis.
    Hierarchical Time-Dependent Oracles.
    In: Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC 2016).
    [ html | pdf ]
  3. Spyros Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner und Christos Zaroliagis.
    Engineering Oracles for Time-Dependent Road Networks.
    In: Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX '16).
    [ hrml | pdf ]
  4. Spyros Kontogiannis, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner und Christos Zaroliagis.
    Improved Oracles for Time-Dependent Road Networks.
    Technical Report on arXiv.
    [ html ]
  5. Lars Briem, Sebastian Buck, Nicolai Mallig, Peter Vortisch, Ben Strasser, Dorothea Wagner und Tobias Zündorf.
    Modeling public transport in mobiTopp.
    In: Proceedings of the 6th International Workshop on Agent-based Mobility, Traffic and Transportation Models, Methodologies and Applications (ABMTRANS'17).
  6. Lars Briem, Sebastian Buck, Holger Ebhart, Nicolai Mallig, Ben Strasser, Peter Vortisch, Dorothea Wagner und Tobias Zündorf.
    Efficient Traffic Assignment for Public Transit Networks.
    In: Proceedings of the 16th International Symposium on Experimental Algorithms (SEA'17), Lecture Notes in Computer Science, pages 20:1-20:14. Springer, 2017.
    [ html | pdf ]
  7. Dorothea Wagner und Tobias Zündorf.
    Public Transit Routing with Unrestricted Walking.
    In: Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS '17), volume 59 of OpenAccess Series in Informatics (OASIcs), pages 7:1-7:14, 2017. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
    [ html | pdf ]
  8. Daniel Delling, Julian Dibbelt, Thomas Pajor und Tobias Zündorf.
    Faster Transit Routing by Hyper Partitioning.
    In: Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS '17), volume 59 of OpenAccess Series in Informatics (OASIcs), pages 8:1-8:14, 2017. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
    [ html | pdf ]
  9. Ben Strasser.
    Dynamic Time-Dependent Routing in Road Networks Through Sampling.
    In: Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS '17), volume 59 of OpenAccess Series in Informatics (OASIcs), pages 3:1–3:17, 2017. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
    [ html | pdf ]
  10. Spyros Kontogiannis, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner und Christos Zaroliagis.
    Improved Oracles for Time-Dependent Road Networks.
    In: Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS '17), volume 59 of OpenAccess Series in Informatics (OASIcs), pages 4:1–4:17, 2017. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
    [ html | pdf ]