Meeting Locations in Real-Time Ridesharing Problem: A Buckets Approach

DOI10.1007/978-3-319-27680-9_5zbMATH Open1367.90007OpenAlexW2388392231MaRDI QIDQ5281604FDOQ5281604

Authors: Kamel Aissat, A. Oulamara 

Publication date: 26 July 2017

Published in: Operations Research and Enterprise Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27680-9_5

Recommendations

• Real-time ride-sharing substitution service in multi-modal public transport using buckets
• Fast, Exact and Scalable Dynamic Ridesharing
• Dynamic matching for real-time ride sharing
• Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems
• The flexible and real-time commute trip sharing problems
• Approximate ridesharing of personal vehicles problem
• Approximate ridesharing of personal vehicles problem
• Trip-vehicle assignment algorithms for ride-sharing
• A dynamic tree algorithm for peer-to-peer ridesharing matching

zbMATH Keywords

operations researchshortest path problemtransportationgeographical mapsridesharing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cited In (6)

• A data-driven matching algorithm for ride pooling problem
• A dynamic tree algorithm for peer-to-peer ridesharing matching
• Real-time ride-sharing substitution service in multi-modal public transport using buckets
• Fast detour computation for ride sharing
• Iterated tabu search for the mix fleet vehicle routing problem with heterogenous electric vehicles
• Fast many-to-many routing for dynamic taxi sharing with meeting points

This page was built for publication: Meeting Locations in Real-Time Ridesharing Problem: A Buckets Approach

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