Robust dynamic real-time control strategies for high-frequency bus service: a multi-agent reinforcement learning framework
Document Type
Journal Article
Publication Date
2026
Subject Area
mode - bus, operations - reliability, operations - frequency, technology - intelligent transport systems, ridership - demand
Keywords
deep deterministic policy gradient, holding, model-free multi-agent reinforcement learning, speed control, synchronized transfer
Abstract
This study addresses the multifaceted challenge of ensuring the regularity of bus services, minimizing bus bunching, and facilitating synchronized bus connections across routes. An enhanced multi-agent reinforcement learning algorithm, namely the Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm, is proposed to implement real-time control strategies for addressing these issues simultaneously. The merit of the modified MADDPG algorithm lies in its ability to continuously learn while adeptly navigating the non-stationary operating nature of bus system networks. A case study of a bus corridor is used to train and test the algorithm. Four robust scenarios, each presenting varying degrees of travel time and dwell time variations, are designed to assess the algorithm’s robustness. Results indicate that the MADDPG algorithm can significantly increase the likelihood of synchronized bus transfers across multiple routes by two or three times while maintaining the service reliability on each route. Moreover, the flexibility of the MADDPG algorithm in training bus policies allows it to effectively adapt to up to 90% variations in bus travel times and demand changes, even amid disruptive events in real-world scenarios.
Rights
Permission to publish the abstract has been given by Taylor&Francis, copyright remains with them.
Recommended Citation
Low, V. J. M., Khoo, H. L., & Khoo, W. C. (2026). Robust dynamic real-time control strategies for high-frequency bus service: a multi-agent reinforcement learning framework. Journal of Intelligent Transportation Systems, 30(1), 157-176.
