Bike Sharing Demand Prediction based on Knowledge Sharing across Modes:
A Graph-based Deep Learning Approach
- URL: http://arxiv.org/abs/2203.10961v1
- Date: Fri, 18 Mar 2022 06:10:17 GMT
- Title: Bike Sharing Demand Prediction based on Knowledge Sharing across Modes:
A Graph-based Deep Learning Approach
- Authors: Yuebing Liang, Guan Huang, Zhan Zhao
- Abstract summary: This study proposes a graph-based deep learning approach for bike sharing demand prediction (B-MRGNN) with multimodal historical data as input.
A multi-relational graph neural network (MRGNN) is introduced to capture correlations between spatial units across modes.
Experiments are conducted using real-world bike sharing, subway and ride-hailing data from New York City.
- Score: 8.695763084463055
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Bike sharing is an increasingly popular part of urban transportation systems.
Accurate demand prediction is the key to support timely re-balancing and ensure
service efficiency. Most existing models of bike-sharing demand prediction are
solely based on its own historical demand variation, essentially regarding bike
sharing as a closed system and neglecting the interaction between different
transport modes. This is particularly important because bike sharing is often
used to complement travel through other modes (e.g., public transit). Despite
some recent efforts, there is no existing method capable of leveraging
spatiotemporal information from multiple modes with heterogeneous spatial
units. To address this research gap, this study proposes a graph-based deep
learning approach for bike sharing demand prediction (B-MRGNN) with multimodal
historical data as input. The spatial dependencies across modes are encoded
with multiple intra- and inter-modal graphs. A multi-relational graph neural
network (MRGNN) is introduced to capture correlations between spatial units
across modes, such as bike sharing stations, subway stations, or ride-hailing
zones. Extensive experiments are conducted using real-world bike sharing,
subway and ride-hailing data from New York City, and the results demonstrate
the superior performance of our proposed approach compared to existing methods.
Related papers
- Predicting travel demand of a bike sharing system using graph convolutional neural networks [0.0]
This study focuses on predicting travel demand within a bike-sharing system.
A novel hybrid deep learning model called the gate graph convolutional neural network is introduced.
By integrating trajectory data, weather data, access data, and leveraging gate graph convolution networks, the accuracy of travel demand forecasting is significantly improved.
arXiv Detail & Related papers (2024-08-18T00:24:30Z) - Deep trip generation with graph neural networks for bike sharing system
expansion [7.737133861503814]
We propose a graph neural network (GNN) approach to predicting the station-level demand based on multi-source urban built environment data.
The proposed approach can be regarded as a generalized spatial regression model, indicating the commonalities between spatial regression and GNNs.
arXiv Detail & Related papers (2023-03-20T16:43:41Z) - Predicting Citi Bike Demand Evolution Using Dynamic Graphs [81.12174591442479]
We apply a graph neural network model to predict bike demand in the New York City, Citi Bike dataset.
In this paper, we attempt to apply a graph neural network model to predict bike demand in the New York City, Citi Bike dataset.
arXiv Detail & Related papers (2022-12-18T21:43:27Z) - Cross-Mode Knowledge Adaptation for Bike Sharing Demand Prediction using
Domain-Adversarial Graph Neural Networks [8.695763084463055]
This study proposes a domain-adversarial multi-relational graph neural network (DA-MRGNN) for bike sharing demand prediction.
A temporal adversarial adaptation network is introduced to extract shareable features from patterns demand of different modes.
Experiments are conducted using real-world bike sharing, subway and ride-hailing data from New York City.
arXiv Detail & Related papers (2022-11-16T13:35:32Z) - Continuous-Time and Multi-Level Graph Representation Learning for
Origin-Destination Demand Prediction [52.0977259978343]
This paper proposes a Continuous-time and Multi-level dynamic graph representation learning method for Origin-Destination demand prediction (CMOD)
The state vectors keep historical transaction information and are continuously updated according to the most recently happened transactions.
Experiments are conducted on two real-world datasets from Beijing Subway and New York Taxi, and the results demonstrate the superiority of our model against the state-of-the-art approaches.
arXiv Detail & Related papers (2022-06-30T03:37:50Z) - Improving short-term bike sharing demand forecast through an irregular
convolutional neural network [16.688608586485316]
The study proposes an irregular convolutional Long-Short Term Memory model (IrConv+LSTM) to improve short-term bike sharing demand forecast.
The proposed model is evaluated with a set of benchmark models in five study sites, which include one dockless bike sharing system in Singapore, and four station-based systems in Chicago, Washington, D.C., New York, and London.
The model also achieves superior performance in areas with varying levels of bicycle usage and during peak periods.
arXiv Detail & Related papers (2022-02-09T10:21:45Z) - Euro-PVI: Pedestrian Vehicle Interactions in Dense Urban Centers [126.81938540470847]
We propose Euro-PVI, a dataset of pedestrian and bicyclist trajectories.
In this work, we develop a joint inference model that learns an expressive multi-modal shared latent space across agents in the urban scene.
We achieve state of the art results on the nuScenes and Euro-PVI datasets demonstrating the importance of capturing interactions between ego-vehicle and pedestrians (bicyclists) for accurate predictions.
arXiv Detail & Related papers (2021-06-22T15:40:21Z) - Dynamic Planning of Bicycle Stations in Dockless Public Bicycle-sharing
System Using Gated Graph Neural Network [79.61517670541863]
Dockless Public Bicycle-sharing (DL-PBS) network becomes increasingly popular in many countries.
redundant and low-utility stations waste public urban space and maintenance costs of DL-PBS vendors.
We propose a Bicycle Station Dynamic Planning (BSDP) system to dynamically provide the optimal bicycle station layout for the DL-PBS network.
arXiv Detail & Related papers (2021-01-19T02:51:12Z) - Joint predictions of multi-modal ride-hailing demands: a deep multi-task
multigraph learning-based approach [64.18639899347822]
We propose a deep multi-task multi-graph learning approach, which combines multiple multi-graph convolutional (MGC) networks for predicting demands for different service modes.
We show that our propose approach outperforms the benchmark algorithms in prediction accuracy for different ride-hailing modes.
arXiv Detail & Related papers (2020-11-11T07:10:50Z) - STDI-Net: Spatial-Temporal Network with Dynamic Interval Mapping for
Bike Sharing Demand Prediction [3.7875603451557076]
In this paper, we propose a novel deep learning method called Spatial-Temporal Dynamic Interval Network (STDI-Net)
The method predicts the number of renting and returning orders of multiple connected stations in the near future by modeling joint spatial-temporal information.
Extensive experiments are conducted on the NYC Bike dataset, the results demonstrate the superiority of our method over existing methods.
arXiv Detail & Related papers (2020-06-07T08:52:40Z) - Constructing Geographic and Long-term Temporal Graph for Traffic
Forecasting [88.5550074808201]
We propose Geographic and Long term Temporal Graph Convolutional Recurrent Neural Network (GLT-GCRNN) for traffic forecasting.
In this work, we propose a novel framework for traffic forecasting that learns the rich interactions between roads sharing similar geographic or longterm temporal patterns.
arXiv Detail & Related papers (2020-04-23T03:50:46Z)
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.