Efficient algorithms for fully multimodal journey planning

DOI10.4230/OASICS.ATMOS.2022.14MaRDI QIDQ6570908zbMATH OpenFDO

Authors Moritz Potthoff, Jonas Sauer

Publication date 10 July 2024

Full work available at URL https://doi.org/10.4230/OASICS.ATMOS.2022.14

zbMATH Keywords

algorithmsjourney planningmulticriteriamultimodalpublic transit

Mathematics Subject Classification ID

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

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

Cited in

(6)

• Computing multimodal journeys in practice
• Fast multimodal journey planning for three criteria
• Fast and delay-robust multimodal journey planning
• 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

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)