Trip-based public transit routing

DOI10.1007/978-3-662-48350-3_85zbMATH Open1466.90025arXiv1504.07149OpenAlexW3101068778MaRDI QIDQ3452863FDOQ3452863

Authors: Sascha Witt 

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

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

Full work available at URL: https://arxiv.org/abs/1504.07149

Recommendations

• Round-Based Public Transit Routing
• Fast and exact public transit routing with restricted Pareto sets
• Intriguingly simple and fast transit routing
• Fast routing in very large public transportation networks using transfer patterns
• Scalable transfer patterns

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Traffic problems in operations research (90B20) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)

Cites Work

• On the cardinality of the Pareto set in bicriteria shortest path problems
• Efficient models for timetable information in public transportation systems
• Fast routing in very large public transportation networks using transfer patterns
• Time-dependent networks as models to achieve fast exact time-table queries
• Parallel computation of best connections in public transportation networks
• Engineering graph-based models for dynamic timetable information systems
• Intriguingly simple and fast transit routing
• Accelerating time-dependent multi-criteria timetable information is harder than expected

Cited In (24)

• Trip-based path algorithms using the transit network hierarchy
• Parallel computation of best connections in public transportation networks
• REX: a realistic time-dependent model for multimodal public transport
• Routing in multimodal transportation networks with non-scheduled lines
• Mode personalization in trip-based transit routing
• Integrating ULTRA and trip-based routing
• A graph- and monoid-based framework for price-sensitive routing in local public transportation networks
• Title not available (Why is that?)
• Delay-robustness of transfer patterns in public transportation route planning
• Efficient traffic assignment for public transit networks
• Computing and listing \(st\)-paths in public transportation networks
• Is timetabling routing always reliable for public transport?
• Fast and exact public transit routing with restricted Pareto sets
• Round-Based Public Transit Routing
• Result diversity for multi-modal route planning
• Connection Scan Algorithm
• Applications and Theory of Petri Nets 2004
• Connection scan accelerated
• Scalable transfer patterns
• Engineering graph-based models for dynamic timetable information systems
• Intriguingly simple and fast transit routing
• Title not available (Why is that?)
• Fast routing in very large public transportation networks using transfer patterns
• Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network

This page was built for publication: Trip-based public transit routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452863)