A Baselined Gated Attention Recurrent Network for Request Prediction in Ridesharing

Jingran Shen, Nikos Tziritas, Georgios Theodoropoulos
7/11/2022
cs.LGcs.NE

No official code found. Best implementation: WingsUpete/RSODP (3 stars, MIT, last commit 2022-06-19).

Abstract

Ridesharing has received global popularity due to its convenience and cost efficiency for both drivers and passengers and its strong potential to contribute to the implementation of the UN Sustainable Development Goals. As a result, recent years have witnessed an explosion of research interest in the RSODP (Origin-Destination Prediction for Ridesharing) problem with the goal of predicting the future ridesharing requests and providing schedules for vehicles ahead of time. Most of the existing prediction models utilise Deep Learning. However, they fail to effectively consider both spatial and temporal dynamics. In this paper the Baselined Gated Attention Recurrent Network (BGARN), is proposed, which uses graph convolution with multi-head gated attention to extract spatial features, a recurrent module to extract temporal features, and a baselined transferring layer to calculate the final results. The model is implemented with PyTorch and DGL (Deep Graph Library) and is experimentally evaluated using the New York Taxi Demand Dataset. The results show that BGARN outperforms all the other existing models in terms of prediction accuracy.

View on arXivView PDF

Code Implementations(1)

WingsUpete/RSODPCommunity100%
MIT

Origin-Destination Prediction for Ridesharing System

32Shell, PythonMar 14, 20214 years agoMIT

Similar Papers

Cite this paper

@article{shen2022baselined,
  title  = {A Baselined Gated Attention Recurrent Network for Request Prediction in Ridesharing},
  author = {Jingran Shen and Nikos Tziritas and Georgios Theodoropoulos},
  year   = {2022},
  eprint = {2207.04709},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.04709v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.04709.svg)](https://codeofpaper.com/paper/2207.04709)

Discussion