Fast detour computation for ride sharing

DOI10.4230/OASICS.ATMOS.2010.88MaRDI QIDQ2917292zbMATH OpenOpenAlexFDO

Authors Robert Geisberger, Dennis Luxen, Sabine Neubauer, Peter Sanders, Lars Volker

Publication date 28 September 2012

Full work available at URL https://arxiv.org/pdf/0907.5269.pdf

zbMATH Keywords

algorithm engineeringcarpoolride sharing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Programming involving graphs or networks (90C35)

Recommendations

• Meeting Locations in Real-Time Ridesharing Problem: A Buckets Approach
• Approximate ridesharing of personal vehicles problem
• Efficient algorithms for ridesharing of personal vehicles
• Efficient algorithms for ridesharing of personal vehicles
• A dynamic tree algorithm for peer-to-peer ridesharing matching

Cited in

(4)

• Optimization for dynamic ride-sharing: a review
• Customizable contraction hierarchies
• Real-time ride-sharing substitution service in multi-modal public transport using buckets
• Fast many-to-many routing for dynamic taxi sharing with meeting points

This page was built for publication: Fast detour computation for ride sharing

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