Predicting Citi Bike Demand Evolution Using Dynamic Graphs
- URL: http://arxiv.org/abs/2212.09175v1
- Date: Sun, 18 Dec 2022 21:43:27 GMT
- Title: Predicting Citi Bike Demand Evolution Using Dynamic Graphs
- Authors: Alexander Saff, Mayur Bhandary, Siddharth Srivastava
- Abstract summary: 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.
- Score: 81.12174591442479
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Bike sharing systems often suffer from poor capacity management as a result
of variable demand. These bike sharing systems would benefit from models to
predict demand in order to moderate the number of bikes stored at each station.
In this paper, we attempt to apply a graph neural network model to predict bike
demand in the New York City, Citi Bike dataset.
Related papers
- Evaluating the effects of Data Sparsity on the Link-level Bicycling Volume Estimation: A Graph Convolutional Neural Network Approach [54.84957282120537]
We present the first study to utilize a Graph Convolutional Network architecture to model link-level bicycling volumes.
We estimate the Annual Average Daily Bicycle (AADB) counts across the City of Melbourne, Australia using Strava Metro bicycling count data.
Our results show that the GCN model performs better than these traditional models in predicting AADB counts.
arXiv Detail & Related papers (2024-10-11T04:53:18Z) - Bent & Broken Bicycles: Leveraging synthetic data for damaged object
re-identification [59.80753896200009]
We propose a novel task of damaged object re-identification, which aims at distinguishing changes in visual appearance due to deformations or missing parts from subtle intra-class variations.
We leverage the power of computer-generated imagery to create, in a semi-automatic fashion, high-quality synthetic images of the same bike before and after a damage occurs.
As a baseline for this task, we propose TransReI3D, a multi-task, transformer-based deep network unifying damage detection.
arXiv Detail & Related papers (2023-04-16T20:23:58Z) - 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) - Bike Sharing Demand Prediction based on Knowledge Sharing across Modes:
A Graph-based Deep Learning Approach [8.695763084463055]
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.
arXiv Detail & Related papers (2022-03-18T06:10:17Z) - 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) - Dynamic Bicycle Dispatching of Dockless Public Bicycle-sharing Systems
using Multi-objective Reinforcement Learning [79.61517670541863]
How to use AI to provide efficient bicycle dispatching solutions based on dynamic bicycle rental demand is an essential issue for dockless PBS (DL-PBS)
We propose a dynamic bicycle dispatching algorithm based on multi-objective reinforcement learning (MORL-BD) to provide the optimal bicycle dispatching solution for DL-PBS.
arXiv Detail & Related papers (2021-01-19T03:09:51Z) - 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) - Towards Dynamic Urban Bike Usage Prediction for Station Network
Reconfiguration [7.5640951518267165]
Bike station-level prediction algorithm called AtCoR can predict bike usage at both existing and new stations.
AtCoR outperforms baselines and state-of-art models in prediction of both existing and future stations.
arXiv Detail & Related papers (2020-08-13T23:41:29Z) - Exploiting Interpretable Patterns for Flow Prediction in Dockless Bike
Sharing Systems [45.45179250456602]
We propose an Interpretable Bike Flow Prediction (IBFP) framework, which can provide effective bike flow prediction with interpretable traffic patterns.
By dividing the urban area into regions according to flow density, we first model the bike flows between regions with graph regularized sparse representation.
Then, we extract traffic patterns from bike flows using subspace clustering with sparse representation to construct interpretable base matrices.
Finally, experimental results on real-world data show the advantages of the IBFP method for flow prediction in dockless bike sharing systems.
arXiv Detail & Related papers (2020-04-13T05:31:50Z)
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.