Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 0Transportation Planning and OptimizationTraffic Prediction and Management TechniquesTraffic control and management

The DOI matches its Crossref record; 12 of the 16 references it cites were found in a registry or an index, and 2 are not checked yet; none of the 26 sources its claims cite is checked for support yet.

Real-time bus arrival prediction and bus bunching prevention using a multi-agent LSTM approach

Open access

Abstract

Introduction: Bus bunching is a major challenge in urban public transportation because it reduces operational efficiency and increases passenger waiting times. Although transit agencies increasingly use real-time passenger information (RTPI) systems, existing predictive approaches often face limitations caused by sparse historical GPS data, particularly when data are collected at long polling intervals such as 10 minutes. In addition, conventional reactive control strategies frequently depend on a central dispatcher. This study addresses these limitations by proposing a scalable, proactive transit-control framework that integrates deep learning with cooperative multi-agent systems (MASs). Methods: The proposed framework uses Metropolitan Transportation Authority (MTA) Service Interface for Real-time Information (SIRI) data and introduces a forward-looking target-imputation mechanism to address data sparsity while retaining more than 90% of the original telemetry. A long short-term memory (LSTM) neural network with categorical route embeddings was developed to simultaneously predict estimated times of arrival (ETAs) at stops across New York City’s 20 highest-frequency bus routes. The predictive model was then embedded directly into autonomous bus agents within an MAS simulation. Through localized communication, the agents could cooperatively implement decentralized stop-skipping, referred to as “EXPRESS” mode, without relying on a central dispatcher. The operational effectiveness of the framework was evaluated through 120-step simulations on routes B82 and Bx9. Results: The LSTM model achieved an overall mean absolute error (MAE) of 2.02 minutes, representing a 28.5% improvement over historical baseline models. The forward-looking imputation mechanism preserved more than 90% of the raw telemetry, demonstrating its effectiveness in mitigating data sparsity. In the MAS simulations, complete bus-bunching collapse, defined as a headway gap approaching zero, did not occur. EXPRESS mode was activated during 19.2% of simulation steps on route B82 and 25.8% on route Bx9. Following every intervention, bus headways recovered above the predefined safe threshold. Discussion: The findings demonstrate that combining local deep-learning-based ETA prediction with cooperative multi-agent control can provide an effective decentralized solution to bus bunching. The proposed approach enables autonomous buses to anticipate operational disruptions and coordinate corrective actions without human intervention or centralized dispatching. Its low ETA prediction error and consistent recovery of safe headways indicate that the framework can improve both predictive accuracy and operational stability. More broadly, the study provides a scalable example of how decentralized artificial intelligence and multi-agent coordination could support proactive transit management and contribute to the development of smart-city transportation systems.

Checked 2026-11-11 · 2 references not checked yet

Overview

CoChat Summary

TL;DR

This paper combines a multi-route LSTM ETA predictor with a decentralized multi-agent stop-skipping protocol to prevent bus bunching using sparse MTA SIRI data. It reports a 2.02-minute MAE, 28.5% improvement over a route-aware baseline, and no full bunching collapse in 120-step simulations on routes B82 and Bx9.

Key findings

  • The LSTM achieved test MAE 2.0247 min (95% CI [2.017, 2.033]), RMSE 5.5486 min, median absolute error 0.73 min, and a 28.5% MAE improvement over the route-aware historical baseline (2.8331 min; Wilcoxon p < 0.001, n = 802,085 test sequences).
  • Forward-looking imputation preserved >90% of raw telemetry versus about 5% under conventional speed-drop preprocessing, yielding 3,743,062 training sequences.
  • In 120-step MAS simulations, the minimum inter-vehicle gap was 3 stop-units on B82 and 4 on Bx9, with zero full-collapse events (gap = 0); EXPRESS mode activated in 23/120 steps (19.2%) on B82 and 31/120 steps (25.8%) on Bx9, with 100% gap recovery above the 30 stop-unit safe threshold after EXPRESS episodes.
  • All 20 routes improved over their individual baselines by 16.6%–39.7%, and per-route accuracy was essentially independent of route data volume (R² = 0.007).

Methods

  • Used >5.5 GB of NYC MTA SIRI GPS telemetry, subset to the 20 busiest routes with roughly 227,000–483,000 observations per route; applied forward-looking target imputation based on changes in `NextStopPointName`, plus Haversine distance, speed, cyclic hour/day features, and learnable 8-dimensional route embeddings.
  • Trained a two-layer LSTM (hidden size 128, dropout 0.2, sequence length 3, 14-dimensional input, 206,113 parameters) in PyTorch with Adam, learning rate 10⁻³, batch size 512, MSE loss, and early stopping; evaluated with route-stratified 70/15/15 splits, MAE/RMSE, bootstrap CI, and Wilcoxon signed-rank tests.
  • Embedded the frozen LSTM into a Python Mesa cooperative MAS with a 1D circular route, static StopAgents, dynamic BusAgents, and a local consensus rule: EXPRESS when passengers ≥ 45 and headway gap ≤ 15 stop-units, returning to NORMAL when gap > 30; ran 120-step simulations on B82 and Bx9 with five BusAgents per route.

Limitations

  • Stated: simulation time features are partly hardcoded; ETA estimates may be less accurate during initial sequence warm-up; route generalization is limited to trained routes unless retraining occurs; stop-skipping may increase waiting for passengers at skipped stops under extreme demand.
  • Stated as future work: fairness constraints, transfer penalties, weather/incident feeds, and online learning across seasons.
  • Evident from the text: validation is simulation-only on two routes over 120 steps, with fixed thresholds and no real-world deployment or quantified passenger wait-time outcomes; cross-study MAE comparisons are also limited by different cities, datasets, and route selections.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.3389/fbuil.2026.1894212

Cites

12 of 16 references verified1 citation errors · 1 not checkable

Statistics

Nothing to recompute.

Figures

Image 1
CC-BY · From the PDF
Image 2
CC-BY · From the PDF
Image 3
CC-BY · From the PDF
Image 4
CC-BY · From the PDF
Image 5
CC-BY · From the PDF
Image 6
CC-BY · From the PDF
Image 7
CC-BY · From the PDF
Image 8
CC-BY · From the PDF
Image 9
CC-BY · From the PDF
Image 10
CC-BY · From the PDF
Image 11
CC-BY · From the PDF
Image 12
CC-BY · From the PDF
Image 13
CC-BY · From the PDF
Image 14
CC-BY · From the PDF

Verification

Claims the paper makes

0 Valid · 3 Not valid · 19 Not checked · 104 Own results and interpretations

49 more claims

Create a free account to see all 126 claims and to verify the 1 reference still open.

See all claims — free account
  • It may state two separate claims as one. 51
  • The quote only partly states this claim. 4
  • Probably not a substantial claim. 31

Create a free account to see these claims.

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

5 of 6 · the rest aren’t loaded

1 more finding

Create a free account to see every finding of this check.

See all findings — free account

Citations

Cites

Research works printed but not linked: 7

  1. Abkowitz, 1984, Methods for maintaining transit service regularity, Transp. Res. Rec., 1
  2. Alesiani, 2018, Reinforcement learning-based bus holding control: a case study, 2489
  3. Liu, 2007, Modelling Urban Bus Service and Passenger Reliability. In: The Third International Symposium on Transportation Network Reliability
  4. Ma, 2019, Processing raw GPS data from public transit systems: a framework for bus arrival time estimation, Transp. Res. Rec., 2673, 11, 10.1177/0361198119841145 · DOI
  5. Newell, 1964, Maintaining a bus schedule, Australian road research board (arrb) conference, 2nd, 1964, melbourne, 2
  6. Wall, 1999, An algorithm for predicting the arrival time of mass transit vehicles using automatic vehicle location data
  7. Wooldridge, 2009, An Introduction to MultiAgent Systems

Cited by

Still being checked.

Metadata

Authors
Rawat, S., Abaidullina, A., Alimbayeva, D., Kumar, D., & Kumar, P.
Affiliations
  • Amity University (IN)
  • Astana IT University (KZ)
  • Texas Tech University (US)
Corresponding author
  • Rawat, Seema
  • Kumar, Deepak
Venue
Frontiers in Built Environment
Published
2026-09-22
Volume
12
ISSN
2297-3362 (ISSN-L)
OpenAlex
W7213969655
Cited by
0
References
12
FWCI
0.00
Type
journal article
Language
en
Open access
Locations
  • Frontiers in Built Environment (publishedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
Topics
  • Social Sciences › Transportation › Transportation Planning and Optimization
  • Social Sciences › Transportation › Traffic Prediction and Management Techniques
  • Physical Sciences › Engineering › Control and Systems Engineering › Traffic control and management
Keywords
bus bunching, bus arrival prediction, estimated time of arrival, multi-agent systems, LSTM, real-time passenger information, missing data imputation, stop skipping, bus headway, autonomous buses, urban public transportation

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.

A language model drew the claims from the paper on 2026-11-11, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-11-11 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

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

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.