🌙

细粒度起讫点矩阵的时空预测及其在网约车中的应用

Spatio-Temporal Prediction of Fine-Grained Origin-Destination Matrices with Applications in Ridesharing

Journal of Computational and Graphical Statistics · 2026
被引 0 · 同刊同年前 5%
ABS 3

中文导读

提出OD-CED模型,通过无监督空间粗化缓解数据稀疏,结合编码器-解码器结构预测细粒度起讫点需求,在稀疏度超90%的矩阵上均方根误差降低45%。

Abstract

Accurate spatial-temporal prediction of network-based travelers’ requests is crucial for the effective policy design of ridesharing platforms. Having knowledge of the total demand between various locations in the upcoming time slots enables platforms to proactively prepare adequate supplies, thereby increasing the likelihood of fulfilling travelers’ requests and redistributing idle drivers to areas with high potential demand to optimize the global supply-demand equilibrium. This paper delves into the prediction of Origin-Destination (OD) demands at a fine-grained spatial level, especially when confronted with an expansive set of local regions. While this task holds immense practical value, it remains relatively unexplored within the research community. To fill this gap, we introduce a novel prediction model called OD-CED, which comprises an unsupervised space coarsening technique to alleviate data sparsity and an encoder-decoder architecture to capture both semantic and geographic dependencies. Through practical experimentation, OD-CED has demonstrated remarkable results. It achieved an impressive reduction of up to 45% reduction in root-mean-square error and 60% in weighted mean absolute percentage error over traditional statistical methods when dealing with OD matrices exhibiting a sparsity exceeding 90%.

网约车时空预测起讫点矩阵数据稀疏性