Computing multimodal journeys in practice

DOI10.1007/978-3-642-38527-8_24MaRDI QIDQ6534371zbMATH OpenFDO

Authors Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, Renato F. Werneck

Publication date 21 January 2014

Full work available at URL https://doi.org/10.1007/978-3-642-38527-8_24

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

• User-constrained multimodal route planning
• User-Constrained Multi-Modal Route Planning
• Fast multimodal journey planning for three criteria
• Efficient algorithms for fully multimodal journey planning
• Result diversity for multi-modal route planning

Cited in

(5)

• Computing Multi-Modal Journey Plans under Uncertainty
• Fast multimodal journey planning for three criteria
• Efficient algorithms for fully multimodal journey planning
• Routing in multimodal transportation networks with non-scheduled lines
• An efficient solution for one-to-many multi-modal journey planning

This page was built for publication: Computing multimodal journeys in practice

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