arXiv Open Access 2015

Trip-Based Public Transit Routing

Sascha Witt

Lihat Sumber

Abstrak

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 70 ms after a preprocessing phase of 30 s, allowing fast queries in dynamic scenarios.

Topik & Kata Kunci

cs.DS

Penulis (1)

Sascha Witt

Format Sitasi

APA MLA BibTeX

Witt, S. (2015). Trip-Based Public Transit Routing. https://arxiv.org/abs/1504.07149

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2015
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓