NCST Report - Dynamic Ride-Sharing with HOV Lanes and Meeting Points

In this research report, we explored the use of HOV lanes and meeting points in a ride-sharing system where drivers have their own origin and destination. We proposed a two-stage heuristic algorithm that consists of an insertion heuristic to solve the PDP problem and a second-stage algorithm that can solve the meeting points problem optimally in polynomial time. Our experimental results show that the HOV lanes and meeting points can increase the efficiency of the dynamic ride-sharing system. Method used: Randomly generated on a computer. For details, check the experimental section in the report. Hardware info: CPU - AMD RYZEN 9 3900X RAM - 16GB Software info: Language - Python, randomization using the Numpy module with a seed of 1000