A dynamic tree algorithm for peer-to-peer ridesharing matching

DOI10.1007/S11067-021-09523-YMaRDI QIDQ2129373zbMATH OpenOpenAlexFDO

Authors Rui Yao, Shlomo Bekhor

Publication date 22 April 2022

Published in Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2105.13078

zbMATH Keywords

matchingvehicle routing problemdynamic treepeer-to-peer ridesharing

Mathematics Subject Classification ID

Operations research and management science (90Bxx) Theory of computing (68Qxx) Mathematical programming (90Cxx)

Recommendations

• Pricing and allocation algorithm designs in dynamic ridesharing system
• Dynamic and stochastic rematching for ridesharing systems: formulations and reductions
• Meeting Locations in Real-Time Ridesharing Problem: A Buckets Approach
• A data-driven matching algorithm for ride pooling problem
• Dynamic matching for real-time ride sharing

Cites work

• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• Improve traffic efficiency with advanced travel time feedback in urban networks
• Incorporating ridesharing in the static traffic assignment model
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Stochastic ridesharing user equilibrium in transport networks
• The General Pickup and Delivery Problem
• The dial-a-ride problem: Models and algorithms
• The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
• `` Strong NP-Completeness Results

Cited in

(6)

• Fast detour computation for ride sharing
• Meeting Locations in Real-Time Ridesharing Problem: A Buckets Approach
• Dynamic and stochastic rematching for ridesharing systems: formulations and reductions
• Dynamic matching for real-time ride sharing
• Incorporating ridesharing in the static traffic assignment model
• A data-driven matching algorithm for ride pooling problem

This page was built for publication: A dynamic tree algorithm for peer-to-peer ridesharing matching

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