Dynamic Routing for Ride-Sharing

The research report explored the use of High Occupancy Vehicle (HOV) lanes and meeting points in a ride-sharing system where drivers have their own origin and destination. A two-stage heuristic algorithm is proposed, which consists of an insertion heuristic to solve the pickup and delivery problem (PDP) problem and a second stage algorithm that can solve the meeting points problem optimally in polynomial time. The experimental results show that the HOV lanes and meeting points can increase the efficiency of a dynamic ride-sharing system.