公交联动发车模型的研究

乘客的候车时间可分为2部分(在出发站点的等待时间及在换乘站的换乘时间),仅考虑换乘时间最短的区域公交协调调度模型无法降低乘客在出发站点的等待时间。针对此问题,提出了公交联动发车的概念及需满足的条件。在对乘客类型分类的基础上,分析了弹性乘客候车时间的计算方法,统计了各类型乘客的各部分候车时间,以所有乘客总的候车时间最短为目标建立公交联动发车模型。针对模型变量多的特点,选用遗传算法进行了求解。采用实例对模型的有效性进行了验证。结果表明,在维持发车间隔不变的基础上,联动发车模型较区域协调调度模型在降低乘客候车时间方面具有明显的优势,乘客候车时间降低了15.2%。 

A Study of Bus Coordinated Departure Model

The bus waiting times consist of waiting times at departure stations and transfer times at transfer sta‐tions .The transit coordinate scheduling model (CSM) ,which only focuses on the shortest transfer times ,cannot reduce the waiting times at departure station .This study proposes the concept of bus coordinated departures and its require‐ments .Based on classifications of passenger characteristics ,the waiting times of different types of passengers at the de‐partures and transfer stations were analyzed in order to develop the proposed model with a target of the shortest waiting time .Because of many variables in the model ,genetic algorithm is used to search the solution .The effectiveness of the model was validated by a case study .The results show that CDM will provide shorter waiting times than CSM and the waiting time decreases 15 .2% .