共 2 条
Minimizing passenger waiting time in the multi-route bus fleet allocation problem through distributionally robust optimization and reinforcement learning
被引:4
|作者:
Li, Xiang
[1
,2
]
An, Xiaojie
[1
]
Zhang, Bowen
[1
]
机构:
[1] Beijing Univ Chem Technol, Sch Econ & Management, Beijing 100029, Peoples R China
[2] Changan Univ, Sch Econ & Management, Xian 710064, Shaanxi, Peoples R China
关键词:
Bus fleet allocation;
Distributionally robust optimization;
Genetic algorithm;
Reinforcement learning;
MODEL;
DESIGN;
UNCERTAINTY;
HEADWAY;
D O I:
10.1016/j.cor.2024.106568
中图分类号:
TP39 [计算机的应用];
学科分类号:
081203 ;
0835 ;
摘要:
Public buses serve a vital role in urban transportation systems by alleviating traffic congestion, reducing carbon emissions, and providing cost-effective and accessible travel options. Nonetheless, a noticeable mismatch frequently exists between the supply and demand for bus services, leading to reduced passenger satisfaction in reality, especially in suburban areas. To tackle this problem, our study delves into the bus fleet allocation problem by incorporating a range of real-world operations management issues, including the uncertainty in passenger demand, the coordination of multiple bus routes, the availability of various bus types, the constraints related to parking space and staffing, as well as the maximum departure intervals. To navigate the uncertain passenger demand, a distributionally robust optimization (DRO) model that comprehensively integrates these real-world characteristics is formulated. In addition, we conduct an in-depth analysis of the DRO model and its dual problem, assessing its scalability using a general-purpose solver. We also perform sensitivity analyses within the problem domain to offer valuable managerial insights. For large-scale problems, we develop a multi -operator genetic algorithm and enhance the algorithm's efficiency by incorporating a reinforcement learning mechanism. Finally, comparative experiments based on real-world cases show that: by incorporating a reinforcement learning mechanism, the computational capability of the proposed algorithm has improved by 3.39%; compared to other heuristic algorithms, the efficiency of the proposed algorithm has increased by 5.32%.
引用
收藏
页数:25
相关论文