Fast multimodal journey planning for three criteria

DOI10.1137/1.9781611977042.12MaRDI QIDQ6543137zbMATH OpenFDO

Authors Moritz Potthoff, Jonas Sauer

Publication date 24 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977042.12

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Efficient algorithms for fully multimodal journey planning
• Fast and exact public transit routing with restricted Pareto sets
• Computing multimodal journeys in practice
• Integrating ULTRA and trip-based routing
• User-Constrained Multi-Modal Route Planning

Cited in

(6)

• Computing multimodal journeys in practice
• Fast and delay-robust multimodal journey planning
• Efficient algorithms for fully multimodal journey planning
• An efficient solution for one-to-many multi-modal journey planning
• Integrating ULTRA and trip-based routing
• Mode personalization in trip-based transit routing

This page was built for publication: Fast multimodal journey planning for three criteria

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