TAGCN: Station-level demand prediction for bike-sharing system via a temporal attention graph convolution network

被引:49
作者
Zi, Wenjie [1 ]
Xiong, Wei [1 ]
Chen, Hao [1 ]
Chen, Luo [1 ]
机构
[1] Natl Univ Def Technol, Coll Elect Sci & Technol, 109 Deya Rd, Changsha 410073, Peoples R China
基金
中国国家自然科学基金;
关键词
Bike-sharing system; Temporal attention mechanism; Graph convolutional network; Station-level; Flow prediction; FORECAST ENGINE;
D O I
10.1016/j.ins.2021.01.065
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Bike-sharing systems have been prevalent since their appearance. As a way to solve the difficulty of the last mile, it can reduce greenhouse gas production. In a bike-sharing system, users can pick up bikes at nearby stations and return them to the stations near their destinations, that provides convenience for users. However, the number of bikes rented from or returned to stations changes over time, causing an imbalance in the number of bikes, and leading to both users? and operators? problems. Bikes flow inequality will lead to inefficient use of bike, and waste users? time when the target station has no dock, or the departure station has no bikes. Bike check-out/in flow prediction is a crucial research and practical issue in bikesharing systems, which plays a vital role in bike rebalancing There are three main research ideas in current studies, and the first is clustering-level flow prediction. i.e., all stations are Nowadays, bike-sharing is available in many cities, solving the problem of the last mile, and it is an environmental-friendly way to commute. However, there is a tidal phenomenon in the bike-sharing system, and the rents/returns of bikes at different stations are unbalanced. Thus, bikes at different stations need to be rebalanced regularly and station-level demand prediction plays an essential role in bike-sharing rebalancing. In this paper, a novel deep graph convolutional network (GCN) model with temporal attention (TAGCN) is proposed for bike check-out/in number prediction of each station. TAGCN can not only model the spatial and temporal dependency between varying stations, but also reflect the influence of different time granularity, which are hour-level, day-level and week-level time periodicity. With the help of well-designed temporal attention mechanism, our model can capture the dynamical temporal correlations and comprehensive spatial patterns in bike check-out/in flow effectively. The proposed model consistently outperforms state-of-the-art methods on four real-world bike-sharing datasets that are four seasons data of Divvy Bike System in Chicago. (c) 2021 Elsevier Inc. All rights reserved.
引用
收藏
页码:274 / 285
页数:12
相关论文
共 30 条
  • [1] Bahdanau D, 2016, Arxiv, DOI arXiv:1409.0473
  • [2] Bike Flow Prediction with Multi-Graph Convolutional Networks
    Chai, Di
    Wang, Leye
    Yang, Qiang
    [J]. 26TH ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS (ACM SIGSPATIAL GIS 2018), 2018, : 397 - 400
  • [3] Graph Neural Networks for Social Recommendation
    Fan, Wenqi
    Ma, Yao
    Li, Qing
    He, Yuan
    Zhao, Eric
    Tang, Jiliang
    Yin, Dawei
    [J]. WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, : 417 - 426
  • [4] Feng S., 2018 IEEE 3 INT C DA, P829
  • [5] Feng YL, 2017, 2017 16TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS 2017), P101
  • [6] Fout A, 2017, ADV NEUR IN, V30
  • [7] Different states of multi-block based forecast engine for price and load prediction
    Gao, Wei
    Darvishan, Ayda
    Toghani, Mohammad
    Mohammadi, Mohsen
    Abedinia, Oveis
    Ghadimi, Noradin
    [J]. INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2019, 104 : 423 - 435
  • [8] Geng X, 2019, AAAI CONF ARTIF INTE, P3656
  • [9] Two stage forecast engine with feature selection technique and improved meta-heuristic algorithm for electricity load forecasting
    Ghadimi, Noradin
    Akbarimajd, Adel
    Shayeghi, Hossein
    Abedinia, Oveis
    [J]. ENERGY, 2018, 161 : 130 - 142
  • [10] Graves A, 2012, STUD COMPUT INTELL, V385, P1, DOI [10.1162/neco.1997.9.1.1, 10.1007/978-3-642-24797-2]