Evidence map›Paper›PMID 40663546›Full record

ArticlePloS one2025

Demand prediction for shared bicycles around metro stations incorporating STAGCN.

Xue Xing, Le Wan, Fahui Luo

Abstract read
In one paragraph

Article in PloS one, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Xue XingSchool of Information and Control Engineering, Jilin University of Chemical Technology, Jilin, China.ORCID https://orcid.org/0000-0002-3478-1488
Le WanSchool of Information and Control Engineering, Jilin University of Chemical Technology, Jilin, China.ORCID https://orcid.org/0009-0007-1135-4196
Fahui LuoSchool of Information and Control Engineering, Jilin University of Chemical Technology, Jilin, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The seamless integration of shared bikes and metro systems promotes green and eco-friendly travel, yet the supply-demand imbalance of shared bikes around metro stations remains a critical challenge, making accurate demand prediction particularly crucial. Targeting metro-adjacent areas, this study proposes a method to identify shared bike trips connecting to metro usage, effectively filtering out approximately 24% of non-connecting travel records within the buffer zones. A predictive model integrating a Spatiotemporal Attention Graph Convolutional Network (STAGCN), Long Short-Term Memory (LSTM) network, and Informer is developed to forecast shared bike demand for metro connectivity. Specifically, the Informer model incorporates STAGCN to capture spatial correlations in bike demand and introduces an LSTM module to learn long- and short-term temporal dependencies. The final demand prediction is generated through a multilayer perceptron. Experiments conducted on shared bike and metro datasets in Shenzhen demonstrate that the proposed model achieves a coefficient of determination (R2) of 0.893, outperforming baseline models by 6.7% in prediction accuracy. Additionally, it exhibits lower Root Mean Square Error (RMSE) and Mean Absolute Error (MAE) compared to traditional time-series forecasting methods. The proposed demand prediction model can assist operators in optimizing the allocation of shared bike resources, which is of great significance for improving user experience.

Indexed as

BicyclingTransportationChinaForecastingHumansModels, TheoreticalNeural Networks, Computer

Identifiers

PMID40663546
PMCPMC12262888

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.