The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Multi-output bus travel time prediction with convolutional LSTM neural network
Open accessAbstract
Abstract Accurate and reliable travel time predictions in public transport networks are essential for delivering an attractive service that is able to compete with other modes of transport in urban areas. The traditional application of this information, where arrival and departure predictions are displayed on digital boards, is highly visible in the city landscape of most modern metropolises. More recently, the same information has become critical as input for smart-phone trip planners in order to alert passengers about unreachable connections, alternative route choices and prolonged travel times. More sophisticated Intelligent Transport Systems (ITS) include the predictions of connection assurance, i.e. an expert system that will decide to hold services to enable passenger exchange, in case one of the services is delayed up to a certain level. In order to operate such systems, and to ensure the confidence of passengers in the systems, the information provided must be accurate and reliable. Traditional methods have trouble with this as congestion, and thus travel time variability, increases in cities, consequently making travel time predictions in urban areas a non-trivial task. This paper presents a system for bus travel time prediction that leverages the non-static spatio-temporal correlations present in urban bus networks, allowing the discovery of complex patterns not captured by traditional methods. The underlying model is a multi-output, multi-time-step, deep neural network that uses a combination of convolutional and long short-term memory (LSTM) layers. The method is empirically evaluated and compared to other popular approaches for link travel time prediction and currently available services, including the currently deployed model at Movia, the regional public transport authority in Greater Copenhagen. We find that the proposed model significantly outperforms all the other methods we compare with, and is able to detect small irregular peaks in bus travel times very quickly.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Convolutional LSTM Network: A Machine Learning Approach for Precipitation Nowcasting
Shi, X., Chen, Z., Wang, H., Yeung, D.-Y., Wong, W.-K., & Woo, W.-C. (2015) · arXiv · doi:10.48550/arxiv.1506.04214 · Cited by 7,709
Effect of Real-Time Transit Information on Dynamic Path Choice of Passengers
Cats, O., Koutsopoulos, H. N., Burghout, W., & Toledo, T. (2011) · Transportation Research Record: Journal of the Transportation Research Board · doi:10.3141/2217-06 · Cited by 108
Cited by
Bandara, K., Bergmeir, C., & Smyl, S. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.112896 · Cited by 435
Ma, C., Dai, G., & Zhou, J. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3055258 · Cited by 429
Bus Arrival Time Prediction: A Comprehensive Review
Kumar, B. A., Singh, R., Shaji, H. E., & Vanajakshi, L. (2025) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2025.3545695 · Cited by 13
Public Transit Arrival Prediction: a Seq2Seq RNN Approach
Bhutani, N., Pachal, S., & Achar, A. (2022) · arXiv · doi:10.48550/arxiv.2210.01655 · Cited by 3
Zahin, M. A., Tarannom, R., & Adu-Gyamfi, Y. (2025) · doi:10.21203/rs.3.rs-7756700/v1
Metadata
- Authors
- Petersen, N. C., Rodrigues, F., & Pereira, F. C.
- Venue
- Expert Systems with Applications
- Publisher
- Elsevier BV
- Published
- 2019-04
- Volume
- 120
- Pages
- 426-435
- ISSN
- 0957-4174 (ISSN-L)
- OpenAlex
- W2900682747
- Cited by
- 288
- References
- 3
- FWCI
- 19.76
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Multi-output bus travel time prediction with convolutional LSTM neural network. https://app.cochat.ai/papers/10.1016/j.eswa.2018.11.028
- The paper
- Petersen, N. C., Rodrigues, F., & Pereira, F. C. (2019). Multi-output bus travel time prediction with convolutional LSTM neural network. Expert Systems with Applications. https://doi.org/10.1016/j.eswa.2018.11.028
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.