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

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Yang, Run, Dai, Runpeng, Gao, Siran, Tang, Xiaocheng, Zhou, Fan, Zhu, Hongtu
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866915219383517184
author Yang, Run
Dai, Runpeng
Gao, Siran
Tang, Xiaocheng
Zhou, Fan
Zhu, Hongtu
author_facet Yang, Run
Dai, Runpeng
Gao, Siran
Tang, Xiaocheng
Zhou, Fan
Zhu, Hongtu
contents 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%.
format Preprint
id arxiv_https___arxiv_org_abs_2503_24237
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Spatio-temporal Prediction of Fine-Grained Origin-Destination Matrices with Applications in Ridesharing
Yang, Run
Dai, Runpeng
Gao, Siran
Tang, Xiaocheng
Zhou, Fan
Zhu, Hongtu
Machine Learning
Artificial Intelligence
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%.
title Spatio-temporal Prediction of Fine-Grained Origin-Destination Matrices with Applications in Ridesharing
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2503.24237