Trip-Based Public Transit Routing

Sascha Witt

25 citations0/0 files storedRepository KITopen (Karlsruhe Institute of Technology)

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Urban Transport and Accessibility Railway Systems and Energy Efficiency

Abstract

We study the problem of computing all Pareto-optimal journeys in a public transit network regarding the two criteria of arrival time and number of transfers taken. We take a novel approach, focusing on trips and transfers between them, allowing fine-grained modeling. Our experiments on the metropolitan network of London show that the algorithm computes full 24-hour profiles in 70ms after a preprocessing phase of 30s, allowing fast queries in dynamic scenarios.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 25 citations exist upstream.

References

2016Route Planning in Transportation Networks 2007Efficient models for timetable information in public transportation systems 2014Round-Based Public Transit Routing 2010Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns 2013Intriguingly Simple and Fast Transit Routing 2012Round-Based Public Transit Routing 2010Contraction of Timetable Networks with Realistic Transfers 2012Parallel computation of best connections in public transportation networks

Cited by

2019Fast and Exact Public Transit Routing with Restricted Pareto Sets 2015Scalable Transfer Patterns 2017Engineering graph-based models for dynamic timetable information systems 2017Trip planning within a multimodal urban mobility 2017A hybrid approach to the problem of journey planning with the use of mathematical programming and modern techniques 2022Traveler-oriented multi-criteria decision support for multimodal itineraries

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.