��ɫ����ʱ������򹫽���������ģ�ͺ��㷨

区域公交调度是未来城市公共交通的发展趋势，主要解决如何合理统一安排最初分布于不同车场的车辆完成所有线路固定时刻表对应班次任务，从而减少车队规模和降低营运成本.考虑现实中许多突发事件干扰车辆按时完成班次，本文研究一类灰色旅行时间的区域公交车辆调度问题.在满足多车型、车场容量限制、燃料限制等现实因素基础上，设计改进蚁群算法,编制一个最低营运费用的公交调度方案.该方案可适应不断变化的交通环境，更容易在公交运营中被应用.最后，通过算例验证了模型和算法的正确性.

Model and Algorithm of Regional Bus Scheduling with Grey Travel Time

The regional bus scheduling is the future trend of urban public transport development. It focuses on assigning trips belonged to several routes to buses located at different depots to reduce fleet size and operating costs. With consideration of the emergencies in reality interfering with vehicles to complete a trip on time, this paper studies regional bus scheduling problem with grey travel time to meet some side constraints such as multi-vehicle-type, depots capacities and fuelling, etc. The model is resolved by the improved ant colony algorithm to prepare a lowest-cost scheduling scheme. The proposed scheduling method is easily operated and can be used for different situations. At the last section, an example proves the correctness and effectiveness of the model and algorithm.