Modeling Ride-Sourcing Matching and Pickup Processes based on Additive Gaussian Process Models

Abstract

Matching and pickup processes are core features of ride-sourcing services. Previous studies have adopted abundant analytical models to depict the two processes and obtain operational insights; while the goodness of fit between models and data was dismissed. To simultaneously consider the fitness between models and data and analytically tractable formations, we propose a data-driven approach based on the additive Gaussian Process Model (AGPM) for ride-sourcing market modeling. The framework is tested based on real-world data collected in Hangzhou, China. We fit analytical models, machine learning models, and AGPMs, in which the number of matches or pickups are used as outputs and spatial, temporal, demand, and supply covariates are utilized as inputs. The results demonstrate the advantages of AGPMs in recovering the two processes in terms of estimation accuracy. Furthermore, we illustrate the modeling power of AGPM by utilizing the trained model to design and estimate idle vehicle relocation strategies.

arXiv comment30 pages, 8 figures, 4 tables. Submitted and under review in Transportmetrica B: Transport Dynamics

References in corpus (6)

• Scikit-learn: Machine Learning in Python
• PyTorch: An Imperative Style, High-Performance Deep Learning Library
• Design Space for Graph Neural Networks
• A Decomposition Algorithm to Solve the Multi-Hop Peer-to-Peer Ride-Matching Problem
• Macroscopic Traffic Flow Modeling with Physics Regularized Gaussian Process: A New Insight into Machine Learning Applications
• Heteroscedastic Gaussian processes for uncertainty modeling in large-scale crowdsourced traffic data