Abstract
These days, when the concept of vehicle sharing has been exploited by people a lot, it becomes necessary to predict the flow of the vehicles to match the demand with the availability. Nowadays, in metros like San Francisco and New York, peak hour traffic problem has been a major concern for most of the daily commuters and residents. Bikes are an easy solution for the short commutes and hence should be made available in the designated stations all day round. This project visits the problem of predicting the bike flow at station-level using a novel architecture of Spatial-temporal Graph Convolutional Network. In this project, we consider two types of relations, the temporal patterns and the spatial correlation between the stations to predict the next hour rides. The graph constructed as an input to the model has nodes which are bike stations and edges with weights as the distance between the stations. We consider the graph to be a fully connected graph. The input graph along with the temporal sequences serves as an input to the model with complete convolutional structures. Using the Euclidean haversine distance algorithm, we calculate the great circle distance between the stations in miles. Unlike normal time series analysis, we use distance graph as a relationship matrix between each of the stations. The model was evaluated using the open sourced ford go (now Lyft) bike demand dataset of City of San Francisco with more than 3 million trips data to predict the next hour ride at both station-level and cluster-level. Extensive experiments validate that our STGCN-based model outperformed the baseline methods in terms of RMSE in three different settings, i.e., at the top 10 most popular stations, at the cluster level, and at the station level.