基于乘客换乘需求的重叠线路公交调度优化  

Optimization of bus dispatching on overlapping lines based on passenger transfer demand

作　　者：冯树民[1] 廖嘉雯 赵琥 FENG Shumin;LIAO Jiawen;ZHAO Hu(School of Transportation Science and Engineering,Harbin Institute of Technology,Harbin 150090,China)

机构地区：[1]哈尔滨工业大学交通科学与工程学院,哈尔滨150090

出　　处：《哈尔滨工业大学学报》2022年第3期41-47,共7页Journal of Harbin Institute of Technology

基　　金：国家自然科学基金(71771062)。

摘　　要：为提高重叠公交线路间协同性、减少公交运力资源浪费,提出了考虑乘客换乘的重叠线路公交调度优化方法。根据乘客起讫点与重叠区段的位置关系将乘客划分为三类,深入研究了重叠区站点各类乘客公交出行过程;针对重叠公交线路上乘客换乘行为,以乘客总出行时间最小和公交运营成本最小为目标,车辆发车间隔、始发站首车发车时间及车厢容量限制为约束条件,建立了发车间隔协同优化模型,并采用遗传算法求解。以哈尔滨市3条重叠公交线路为例进行案例分析,结果表明:模型优化后,公交运营成本下降15.2%、乘客总出行时间减少了6.7%,第一、二、三类乘客的候车时间分别下降了3.2%、33.2%和18.6%,验证了模型的有效性。研究成果为重叠线路静态调度方法的理论研究拓宽了思路。To improve the synergy between overlapping bus lines and reduce the capacity resource waste, a bus dispatching optimization method for overlapping lines was proposed considering passenger transfers. Based on the relative positions between the passenger origin-destination and the overlapping sections, passengers were divided into three categories, and the bus travel process of different categories of passengers at the stations in the overlapping area was investigated. In consideration of the passenger transfer behaviors on the overlapping bus lines, a departure interval collaborative optimization model was established, which takes the minimum total passenger travel time and minimum bus operating cost as objects and is constrained by departure interval, first departure time, and capacity limitations. The model was solved by genetic algorithm. Taking three overlapping bus lines in Harbin as an example, results show that after the model was optimized, the bus operating cost was reduced by 15.2%, total travel time of passengers reduced by 6.7%, and waiting time of passengers for three categories reduced by 3.2%, 33.2%, and 18.6% respectively, which verified the effectiveness of the model. The research results provide a new perspective for the theoretical research of static dispatching methods for overlapping lines.

关 键 词：公共交通 调度优化 遗传算法 发车间隔 重叠线路 公交换乘 

分 类 号：U491.17[交通运输工程—交通运输规划与管理]