Wenbo Fan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Wenbo Fan has a total of 72 co-authors. Here are the top co-authors by number of shared publications:
Shilei Guan
China Electric Power Research Institute,Beijing,China
4 shared publicationsXiaoling Luo
3 shared publications- Xiaotian Yan
Southwest Jiaotong University
3 shared publications Changkai Shi
China Electric Power Research Institute,Beijing,China
2 shared publicationsJun Zhang
Southwest Jiaotong University Industry (Group) Co., Ltd, Chengdu, Sichuan, China
2 shared publicationsMeng Xu
2 shared publications
Latest Publications
- 8 July 2026
- Published by Taylor & Francis in Transportmetrica A: Transport Science
- p. 1-31
Soft-target dispatch strategies for transit services with uncertain passenger arrivals
- 8 July 2026
- Published by Taylor & Francis in Transportmetrica A: Transport Science
- p. 1-31
Soft-target dispatch strategies for transit services with uncertain passenger arrivals
- 18 April 2026
- Published by Elsevier in Transportation Research Part D: Transport and Environment
- Vol. 156
Multi-modal charging networks for shared electric vehicle fleets: A data-driven approach
- 18 April 2026
- Published by Elsevier in Transportation Research Part D: Transport and Environment
- Vol. 156
Multi-modal charging networks for shared electric vehicle fleets: A data-driven approach
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Intelligent Transportation Systems
- Vol. 7, 1534-1551
Fly-by Transit: A Novel Door-to-Door Shared Mobility With Minimal Stops
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Intelligent Transportation Systems
- Vol. 7, 1534-1551
Open AccessFly-by Transit: A Novel Door-to-Door Shared Mobility With Minimal Stops
- Open Access
- 1 January 2026
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2026 (1) , 5954156
Reinforcement Learning–Based Timetabling of Bus Routes Subject to Oversaturation
Timetables are crucial for the efficient operation of public transportation. This paper tackles the timetabling problem of a regular bus line facing oversaturation due to stochastic fluctuation in demand and a lack of fleet, making it more complex than traditional undersaturated scenarios. By oversaturation, we mean some passengers may not board the first‐arrival bus and must wait for subsequent ones. We propose a reinforcement learning (RL) model based on the Markov decision process (MDP) to optimize the timetable. The objective is to minimize the expected total system costs, involving the costs of passengers and the operator. Constraints concerning vehicle capacity and fleet size are respected. The dynamics of passengers are captured in the state transition process. The proposed model is applied to the No. 8 bus route in Sanya, China. Specifically, the proximal policy optimization (PPO) algorithm is employed. Under deterministic demand, we compare the optimized timetables against the results obtained by classic models. The results show that the proposed model outperforms classical models in terms of both solution quality and computational efficiency. Under stochastic demand, as variance in demand increases, the benefit of the proposed model in the system cost and passenger waiting time becomes more significant. In addition, we optimize the fleet size, accounting for the acquisition cost of vehicles.
- 1 January 2026
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2026 (1) , 5954156
Open AccessReinforcement Learning–Based Timetabling of Bus Routes Subject to Oversaturation
Timetables are crucial for the efficient operation of public transportation. This paper tackles the timetabling problem of a regular bus line facing oversaturation due to stochastic fluctuation in demand and a lack of fleet, making it more complex than traditional undersaturated scenarios. By oversaturation, we mean some passengers may not board the first‐arrival bus and must wait for subsequent ones. We propose a reinforcement learning (RL) model based on the Markov decision process (MDP) to optimize the timetable. The objective is to minimize the expected total system costs, involving the costs of passengers and the operator. Constraints concerning vehicle capacity and fleet size are respected. The dynamics of passengers are captured in the state transition process. The proposed model is applied to the No. 8 bus route in Sanya, China. Specifically, the proximal policy optimization (PPO) algorithm is employed. Under deterministic demand, we compare the optimized timetables against the results obtained by classic models. The results show that the proposed model outperforms classical models in terms of both solution quality and computational efficiency. Under stochastic demand, as variance in demand increases, the benefit of the proposed model in the system cost and passenger waiting time becomes more significant. In addition, we optimize the fleet size, accounting for the acquisition cost of vehicles.
- 5 July 2025
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 178
Optimal design of on-demand modular feeder transit services
- 5 July 2025
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 178
Optimal design of on-demand modular feeder transit services
- 12 June 2025
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 178
Novel operational algorithms for ride-pooling as on-demand feeder services
- 12 June 2025
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 178
Novel operational algorithms for ride-pooling as on-demand feeder services
- Open Access
- 1 January 2025
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2025 (1)
On the Application of Probabilistic Route Choice Models to Urban Rail Transit Networks Containing Small‐Scale OD Trip Data
Modeling passenger route choices is crucial for analyzing and predicting public transportation demand. One of the most popular methods is to use probabilistic route choice (PRC) models (also known as discrete choice models in general), which have broad applications in transportation, economics, politics, and other fields. However, its performance varies depending on the characteristics of the origin–destination (OD) trip data and should be examined carefully. This paper proposes a framework for validating the PRC model on its application to urban rail transit (URT) networks containing small‐scale OD trip data. The concept of small‐scale data is defined at first for each OD pair considering the desired confidence level and the variance of route choices. Then, a travel time range (TTR)‐based method is put forward to deduce passengers’ actual route choices as a benchmark for verifying PRC models. The difference and regularity analysis between the actual route choices and the model predictions are also performed with a twofold comparison. A case study on the Nanchang metro in China shows that the actual daily passenger volumes on routes of small‐scale OD pairs diverge remarkably from the estimations of the PRC model. The PRC model’s performance is further discussed when the small‐scale OD trip data accumulate to a larger scale over multiple days (e.g., several months). This study reveals the inherent limitation of PRC models in estimating the travel behaviors of passengers in a small‐scale population. Several practical implications are discussed to improve the route choice model and passenger flow analysis.
- 1 January 2025
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2025 (1)
Open AccessOn the Application of Probabilistic Route Choice Models to Urban Rail Transit Networks Containing Small‐Scale OD Trip Data
Modeling passenger route choices is crucial for analyzing and predicting public transportation demand. One of the most popular methods is to use probabilistic route choice (PRC) models (also known as discrete choice models in general), which have broad applications in transportation, economics, politics, and other fields. However, its performance varies depending on the characteristics of the origin–destination (OD) trip data and should be examined carefully. This paper proposes a framework for validating the PRC model on its application to urban rail transit (URT) networks containing small‐scale OD trip data. The concept of small‐scale data is defined at first for each OD pair considering the desired confidence level and the variance of route choices. Then, a travel time range (TTR)‐based method is put forward to deduce passengers’ actual route choices as a benchmark for verifying PRC models. The difference and regularity analysis between the actual route choices and the model predictions are also performed with a twofold comparison. A case study on the Nanchang metro in China shows that the actual daily passenger volumes on routes of small‐scale OD pairs diverge remarkably from the estimations of the PRC model. The PRC model’s performance is further discussed when the small‐scale OD trip data accumulate to a larger scale over multiple days (e.g., several months). This study reveals the inherent limitation of PRC models in estimating the travel behaviors of passengers in a small‐scale population. Several practical implications are discussed to improve the route choice model and passenger flow analysis.
- 20 May 2024
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 185
Optimal design of ride-pooling as on-demand feeder services
- 20 May 2024
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 185
Optimal design of ride-pooling as on-demand feeder services