Efficient algorithms for fully multimodal journey planning

DOI10.4230/OASICS.ATMOS.2022.14zbMATH Open1543.90044MaRDI QIDQ6570908FDOQ6570908

Authors: Moritz Potthoff, Jonas Sauer 

Publication date: 10 July 2024

Recommendations

• Fast multimodal journey planning for three criteria
• User-constrained multimodal route planning
• Computing multimodal journeys in practice
• User-Constrained Multi-Modal Route Planning
• Fast and delay-robust multimodal journey planning

zbMATH Keywords

algorithmsmulticriteriamultimodalpublic transitjourney planning

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Cited In (5)

• Routing in multimodal transportation networks with non-scheduled lines
• An efficient solution for one-to-many multi-modal journey planning
• Integrating ULTRA and trip-based routing
• Fast multimodal journey planning for three criteria
• Fast and delay-robust multimodal journey planning

This page was built for publication: Efficient algorithms for fully multimodal journey planning

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