IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0298684.html
   My bibliography  Save this article

FF-STGCN: A usage pattern similarity based dual-network for bike-sharing demand prediction

Author

Listed:
  • Di Yang
  • Ruixue Wu
  • Peng Wang
  • Yanfang Li

Abstract

Accurate bike-sharing demand prediction is crucial for bike allocation rebalancing and station planning. In bike-sharing systems, the bike borrowing and returning behavior exhibit strong spatio-temporal characteristics. Meanwhile, the bike-sharing demand is affected by the arbitrariness of user behavior, which makes the distribution of bikes unbalanced. These bring great challenges to bike-sharing demand prediction. In this study, a usage pattern similarity-based dual-network for bike-sharing demand prediction, called FF-STGCN, is proposed. Inter-station flow features and similar usage pattern features are fully considered. The model includes three modules: multi-scale spatio-temporal feature fusion module, bike usage pattern similarity learning module, and bike-sharing demand prediction module. In particular, we design a multi-scale spatio-temporal feature fusion module to address limitations in multi-scale spatio-temporal accuracy. Then, a bike usage pattern similarity learning module is constructed to capture the underlying correlated features among stations. Finally, we employ a dual network structure to integrate inter-station flow features and similar usage pattern features in the bike-sharing demand prediction module to realize the final prediction. Experiments on the Citi Bike dataset have demonstrated the effectiveness of our proposed model. The ablation experiments further confirm the indispensability of each module in the proposed model.

Suggested Citation

  • Di Yang & Ruixue Wu & Peng Wang & Yanfang Li, 2024. "FF-STGCN: A usage pattern similarity based dual-network for bike-sharing demand prediction," PLOS ONE, Public Library of Science, vol. 19(3), pages 1-27, March.
  • Handle: RePEc:plo:pone00:0298684
    DOI: 10.1371/journal.pone.0298684
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0298684
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0298684&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0298684?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Xin Liu & Konstantinos Pelechrinis, 2021. "Excess demand prediction for bike sharing systems," PLOS ONE, Public Library of Science, vol. 16(6), pages 1-21, June.
    2. Tae San Kim & Won Kyung Lee & So Young Sohn, 2019. "Graph convolutional network approach applied to predict hourly bike-sharing demands considering spatial, temporal, and global effects," PLOS ONE, Public Library of Science, vol. 14(9), pages 1-16, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Echeverría, Lucía & Gimenez-Nadal, José Ignacio & Molina, José Alberto, 2022. "Active Commuting and the Health of Workers," IZA Discussion Papers 15572, Institute of Labor Economics (IZA).
    2. Ding, Hongliang & Lu, Yuhuan & Sze, N.N. & Li, Haojie, 2022. "Effect of dockless bike-sharing scheme on the demand for London Cycle Hire at the disaggregate level using a deep learning approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 166(C), pages 150-163.
    3. Ali Behroozi & Ali Edrisi, 2025. "Predicting travel demand of a bike sharing system using graph convolutional neural networks," Public Transport, Springer, vol. 17(1), pages 281-317, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0298684. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.