Multi-View Hypergraph-Based Ride-Sourcing Origin-Destination Demand Prediction

Ride-sourcing services have become a vital urban mobility mode, offering flexibility and convenience. Accurate origin-destination (OD) demand prediction is crucial for ride-sourcing platforms to deliver efficient on-demand mobility services. Existing studies have tried to extract complex spatial-temporal dependencies of OD pairs from different aspects. Differently, we propose a novel multi-view hypergraph OD demand prediction framework, which utilizes hypergraphs to associate multiple OD pairs from static and dynamic views simultaneously. In the static hypergraph view, we explore spatial-temporal correlations from three perspectives: points of interest, time series, and motifs. Among them, motifs can capture local higher-order network structures in the OD network. In the dynamic view, we utilize real-time OD demand as prior information to learn representations of multiple OD pairs directly and capture evolving spatial-temporal dependencies. Moreover, a gate mechanism and probability constraints are designed to enhance accuracy and reliability. Finally, experimental results on two large-scale ride-sourcing datasets from Hangzhou and Ningbo verify the superiority of our proposed model over seven baseline models. Accurate OD demand prediction aids in guiding vehicle dispatching and dynamic pricing for ride-sourcing platforms.

Institutions

Publication Details

Journal
IEEE Transactions on Intelligent Transportation Systems
Published
2025-07-18
DOI
https://doi.org/10.1109/tits.2025.3586301
Primary Topic
Transportation and Mobility Innovations
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-View Hypergraph-Based Ride-Sourcing Origin-Destination Demand Prediction

IEEE Transactions on Intelligent Transportation Systems
Transportation and Mobility Innovations
article

Multi-View Hypergraph-Based Ride-Sourcing Origin-Destination Demand Prediction

article en

Abstract

Ride-sourcing services have become a vital urban mobility mode, offering flexibility and convenience. Accurate origin-destination (OD) demand prediction is crucial for ride-sourcing platforms to deliver efficient on-demand mobility services. Existing studies have tried to extract complex spatial-temporal dependencies of OD pairs from different aspects. Differently, we propose a novel multi-view hypergraph OD demand prediction framework, which utilizes hypergraphs to associate multiple OD pairs from static and dynamic views simultaneously. In the static hypergraph view, we explore spatial-temporal correlations from three perspectives: points of interest, time series, and motifs. Among them, motifs can capture local higher-order network structures in the OD network. In the dynamic view, we utilize real-time OD demand as prior information to learn representations of multiple OD pairs directly and capture evolving spatial-temporal dependencies. Moreover, a gate mechanism and probability constraints are designed to enhance accuracy and reliability. Finally, experimental results on two large-scale ride-sourcing datasets from Hangzhou and Ningbo verify the superiority of our proposed model over seven baseline models. Accurate OD demand prediction aids in guiding vehicle dispatching and dynamic pricing for ride-sourcing platforms.

IEEE Transactions on Intelligent Transportation SystemsVol. 26(9)
University of Illinois Urbana-Champaign (US), Zhejiang University (CN), Zhejiang University of Finance and Economics (CN)
Sustainable cities and communities
Openalex Percentile: Top 56%
Transportation and Mobility Innovations
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.