Large language model-enhanced reinforcement learning for generic bus holding control strategies

Bus holding control is a widely-adopted strategy for maintaining stability and improving the operational efficiency of bus systems. Traditional model-based methods often face challenges with the low accuracy of bus state prediction and passenger demand estimation. In contrast, Reinforcement Learning (RL), as a data-driven approach, has demonstrated great potential in formulating bus holding strategies. RL determines the optimal control strategies in order to maximize the cumulative reward, which reflects the overall control goals. However, translating sparse and delayed control goals in real-world tasks into dense and real-time rewards for RL is challenging, normally requiring extensive manual trial-and-error. In view of this, this study introduces an automatic reward generation paradigm by leveraging the in-context learning and reasoning capabilities of Large Language Models (LLMs). This new paradigm, termed the LLM-enhanced RL, comprises several LLM-based modules: reward initializer, reward modifier, performance analyzer, and reward refiner. These modules cooperate to initialize and iteratively improve the reward function according to the feedback from training and test results for the specified RL-based task. Ineffective reward functions generated by the LLM are filtered out to ensure the stable evolution of the RL agents’ performance over iterations. To evaluate the feasibility of the proposed LLM-enhanced RL paradigm , it is applied to extensive bus holding control scenarios that vary in the number of bus lines, stops, and passenger demand. The results demonstrate the superiority, generalization capability, and robustness of the proposed paradigm compared to vanilla RL strategies, the LLM-based controller, physics-based feedback controllers , and optimization-based controllers. This study sheds light on the great potential of utilizing LLMs in various smart mobility applications. • A Large Language Model-enhanced Reinforcement Learning (RL) paradigm is introduced. • The paradigm can automatically generate and refine reward functions for RL. • The paradigm is applied to derive generic bus holding control strategies. • Extensive numerical tests based on synthetic and real-world networks are conducted. • The paradigm shows superiority and promising generalization capability.

Authors

Publication Details

Journal
Transportation Research Part E Logistics and Transportation Review
Published
2025-05-26
DOI
https://doi.org/10.1016/j.tre.2025.104142
Citations
5
Primary Topic
Transportation and Mobility Innovations
Type
article
Field-Weighted Citation Impact
3.41
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Large language model-enhanced reinforcement learning for generic bus holding control strategies

Yuhong Wang, Jiajie Yu, Wei Ma
5 citations
Transportation Research Part E Logistics and Transportation Review
Transportation and Mobility Innovations
3.41
article

Large language model-enhanced reinforcement learning for generic bus holding control strategies

Yuhong Wang, Jiajie Yu, Wei Ma
article en
5 citations

Abstract

Bus holding control is a widely-adopted strategy for maintaining stability and improving the operational efficiency of bus systems. Traditional model-based methods often face challenges with the low accuracy of bus state prediction and passenger demand estimation. In contrast, Reinforcement Learning (RL), as a data-driven approach, has demonstrated great potential in formulating bus holding strategies. RL determines the optimal control strategies in order to maximize the cumulative reward, which reflects the overall control goals. However, translating sparse and delayed control goals in real-world tasks into dense and real-time rewards for RL is challenging, normally requiring extensive manual trial-and-error. In view of this, this study introduces an automatic reward generation paradigm by leveraging the in-context learning and reasoning capabilities of Large Language Models (LLMs). This new paradigm, termed the LLM-enhanced RL, comprises several LLM-based modules: reward initializer, reward modifier, performance analyzer, and reward refiner. These modules cooperate to initialize and iteratively improve the reward function according to the feedback from training and test results for the specified RL-based task. Ineffective reward functions generated by the LLM are filtered out to ensure the stable evolution of the RL agents’ performance over iterations. To evaluate the feasibility of the proposed LLM-enhanced RL paradigm , it is applied to extensive bus holding control scenarios that vary in the number of bus lines, stops, and passenger demand. The results demonstrate the superiority, generalization capability, and robustness of the proposed paradigm compared to vanilla RL strategies, the LLM-based controller, physics-based feedback controllers , and optimization-based controllers. This study sheds light on the great potential of utilizing LLMs in various smart mobility applications. • A Large Language Model-enhanced Reinforcement Learning (RL) paradigm is introduced. • The paradigm can automatically generate and refine reward functions for RL. • The paradigm is applied to derive generic bus holding control strategies. • Extensive numerical tests based on synthetic and real-world networks are conducted. • The paradigm shows superiority and promising generalization capability.

Transportation Research Part E Logistics and Transportation ReviewVol. 200
Openalex Percentile: Top 8%
Transportation and Mobility Innovations
3.41
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.