Ride-Sharing Matching Under Travel Time Uncertainty Through Data-Driven Robust Optimization

Abstract

In ride-sharing services, travel time uncertainty significantly impacts the quality of matching solutions for both the drivers and the riders. This paper studies a one-to-many ride-sharing matching problem where travel time between locations is uncertain. The goal is to generate robust ride-sharing matching solutions that minimize the total driver detour cost and the number of unmatched riders. To this end, we formulate the ride-sharing matching problem as a robust vehicle routing problem with time window (RVRPTW). To effectively capture the travel time uncertainty, we propose a deep learning-based data-driven approach that can dynamically estimate the uncertainty sets of travel times. Given the NP-hard nature of the optimization problem, we design a hybrid meta-heuristic algorithm that can handle large-scale instances in a time-efficient manner. To evaluate the performance of the proposed method, we conduct a set of numeric experiments based on real traffic data. The results confirm that the proposed approach outperforms the non-data-driven one in several important performance metrics, including a proper balance between robustness and inclusiveness of the matching solution. Specifically, by applying the proposed data-driven approach, the matching solution violation rate can be reduced up to 85.8%, and the valid serving rate can be increased up to 42.3% compared to the non-data-driven benchmark.