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

• URL: http://arxiv.org/abs/2503.24237v1
• Date: Mon, 31 Mar 2025 15:52:27 GMT
• Title: Spatio-temporal Prediction of Fine-Grained Origin-Destination Matrices with Applications in Ridesharing
• Authors: Run Yang, Runpeng Dai, Siran Gao, Xiaocheng Tang, Fan Zhou, Hongtu Zhu,
• Abstract summary: We introduce 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.<n>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.
• Score: 14.537612238247565
• License: http://creativecommons.org/licenses/by/4.0/
• 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%.

Related papers

• Mitigating Spatial Disparity in Urban Prediction Using Residual-Aware Spatiotemporal Graph Neural Networks: A Chicago Case Study [8.027373700091331]
  Urban prediction tasks, such as forecasting traffic flow, temperature, and crime rates, are crucial for efficient urban planning and management.<n>Existing Spatiotemporal Graph Neural Networks (ST-GNNs) often rely solely on accuracy, overlooking spatial and demographic disparities in their predictions.<n>This study introduces a Residual-Aware Attention (RAA) Block and an equality-enhancing loss function to address these disparities.
  arXiv  Detail & Related papers  (2025-01-20T01:28:49Z)
• On the potential of Optimal Transport in Geospatial Data Science [2.2766940909460986]
  We propose a spatially aware evaluation metric and loss function based on Optimal Transport (OT) Our framework leverages partial OT and can minimize relocation costs in any spatial prediction problem.
  arXiv  Detail & Related papers  (2024-10-15T15:46:03Z)
• OPUS: Occupancy Prediction Using a Sparse Set [64.60854562502523]
  We present a framework to simultaneously predict occupied locations and classes using a set of learnable queries. OPUS incorporates a suite of non-trivial strategies to enhance model performance. Our lightest model achieves superior RayIoU on the Occ3D-nuScenes dataset at near 2x FPS, while our heaviest model surpasses previous best results by 6.1 RayIoU.
  arXiv  Detail & Related papers  (2024-09-14T07:44:22Z)
• How Much Data are Enough? Investigating Dataset Requirements for Patch-Based Brain MRI Segmentation Tasks [74.21484375019334]
  Training deep neural networks reliably requires access to large-scale datasets. To mitigate both the time and financial costs associated with model development, a clear understanding of the amount of data required to train a satisfactory model is crucial. This paper proposes a strategic framework for estimating the amount of annotated data required to train patch-based segmentation networks.
  arXiv  Detail & Related papers  (2024-04-04T13:55:06Z)
• Spatial-temporal Forecasting for Regions without Observations [13.805203053973772]
  We study spatial-temporal forecasting for a region of interest without any historical observations. We propose a model named STSM for the task. Our key insight is to learn from the locations that resemble those in the region of interest.
  arXiv  Detail & Related papers  (2024-01-19T06:26:05Z)
• SpatialRank: Urban Event Ranking with NDCG Optimization on Spatiotemporal Data [55.609946936979036]
  We propose a novel spatial event ranking approach named SpatialRank. We show that SpatialRank can effectively identify the top riskiest locations of crimes and traffic accidents.
  arXiv  Detail & Related papers  (2023-09-30T06:20:21Z)
• Implicit Occupancy Flow Fields for Perception and Prediction in Self-Driving [68.95178518732965]
  A self-driving vehicle (SDV) must be able to perceive its surroundings and predict the future behavior of other traffic participants. Existing works either perform object detection followed by trajectory of the detected objects, or predict dense occupancy and flow grids for the whole scene. This motivates our unified approach to perception and future prediction that implicitly represents occupancy and flow over time with a single neural network.
  arXiv  Detail & Related papers  (2023-08-02T23:39:24Z)
• Online Metro Origin-Destination Prediction via Heterogeneous Information Aggregation [99.54200992904721]
  We propose a novel neural network module termed Heterogeneous Information Aggregation Machine (HIAM) to jointly learn the evolutionary patterns of OD and DO ridership. An OD modeling branch estimates the potential destinations of unfinished orders explicitly to complement the information of incomplete OD matrices. A DO modeling branch takes DO matrices as input to capture the spatial-temporal distribution of DO ridership. Based on the proposed HIAM, we develop a unified Seq2Seq network to forecast the future OD and DO ridership simultaneously.
  arXiv  Detail & Related papers  (2021-07-02T10:11:51Z)
• Regressive Domain Adaptation for Unsupervised Keypoint Detection [67.2950306888855]
  Domain adaptation (DA) aims at transferring knowledge from a labeled source domain to an unlabeled target domain. We present a method of regressive domain adaptation (RegDA) for unsupervised keypoint detection. Our method brings large improvement by 8% to 11% in terms of PCK on different datasets.
  arXiv  Detail & Related papers  (2021-03-10T16:45:22Z)
• Using Spatio-temporal Deep Learning for Forecasting Demand and Supply-demand Gap in Ride-hailing System with Anonymized Spatial Adjacency Information [0.0]
  A novel-temporal deep learning architecture is proposed for forecasting demand and supply-demand gap in a ride-hailing system with proposed spatial adjacency information. The developed architecture is tested with real-world datasets, which shows that our models can outperform conventional time-series models.
  arXiv  Detail & Related papers  (2020-12-16T11:22:14Z)
• Attentional-GCNN: Adaptive Pedestrian Trajectory Prediction towards Generic Autonomous Vehicle Use Cases [10.41902340952981]
  We propose a novel Graph Convolutional Neural Network (GCNN)-based approach, Attentional-GCNN, which aggregates information of implicit interaction between pedestrians in a crowd by assigning attention weight in edges of the graph. We show our proposed method achieves an improvement over the state of art by 10% Average Displacement Error (ADE) and 12% Final Displacement Error (FDE) with fast inference speeds.
  arXiv  Detail & Related papers  (2020-11-23T03:13:26Z)
• DeepSTCL: A Deep Spatio-temporal ConvLSTM for Travel Demand Prediction [4.0711669706762805]
  A novel deep learning traffic demand forecasting framework based on Deep Spatio-Temporal ConvLSTM is proposed in this paper. The proposed method can capture temporal dependence and spatial dependence simultaneously. The experimental results on DIDI order dataset of Chengdu demonstrate that our method outperforms traditional models with accuracy and speed.
  arXiv  Detail & Related papers  (2020-08-22T13:33:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.