考虑公交内部及公交和地铁、长途客运之间的换乘衔接问题,满足最小和最大发车间隔等现实约束因素,建立了一类多目标多模式公交协调时刻表模型,在某时段内分别追求非换乘和换乘出行者在所有站点的等车时间最少和所有车辆到达站点时的泊位数最多.利用约束法将该问题转化为单目标规划问题.根据模型特征,设计求解该问题的改进细菌觅食优化算法,定义解的编码方案,设计产生初始种群的启发式算法,将梯度概念引入移动步长进而改进细菌觅食操作.最后,结合一个简单算例,比较单模式和多模式区域公交协调调度之间的差异,分析了站点通行能力对调度结果的影响,并将该算法与其他智能算法进行了比较分析,从而验证了模型和算法的正确性和有效性.
Considering the transfer between buses, among bus, subway and long distance passenger transport, to meet the realistic constraints such as maximum and minimum departure intervals etc. , the multi- mode transit coordination schedule models is established. The objective is to minimize the total waiting time for non-transfer and transfer passengers in all stops, and to maximize the number of berths for all vehicles arriving at stations during a given period of time. The problem is converted into a single objective programming problem with constraint method. According to the characteristic of the model, an improved bacterial foraging optimization algorithm, which defines a solution coding, redesigns the heuristic procedure to initialize chromosomes, the concept of ladder is used in moving a step to improve the bacterial foraging operation, is proposed to solve the problem. Finally, a numerical example is taken to reveal the difference in schedule coordination between single and multiple modes of regional bus transit, the influence of station capacity on the schedule scheme is analyzed, and the proposed algorithm is compared with other intelligent algorithms to verify the correctness and effectiveness of the model and its algorithm.