公交车调度问题的数学模型
摘要
本文解决的是某大城市1条公交线路上公交车的调度问题.目的是用尽可能少的车来运送乘客，同时不能让乘客等待时间过长，也不能超载．通过分析知，1个时区内需要的车只与该时区内车站的最大转移客流量有关，首先是对该公交线路上所统计的上车、下车等数据进行1系列变换处理，求出每个时段发的车的最大转移客流量，得到1个新的表格．其次是根据最大转移客流量，用线性规划的方法求出这个模型需要发车次数的最小值，然后综合考虑乘客的等待时间等给出各个时区的发车次数，确定全天发车时间表，由发车时间表，求出的最少车辆数．最后对这个解进行了评价，说明本模型的特点，并指出了进1步优化改进的方向．
关键词：公交调度，时区，算法
A Mathematical Model of Bus Scheduling
ABSTRACT
The scheduling problem of a public transporting ling in a city is studied. Its purpose is to transport passengers using fewest buses without overload, and not to let the passengers waiting for long at the same time. Through analysis, the bus starting form the station in a time zone has relation to the maximum shift capacity of passengers, so the data of the passengers get on and off in each station is processed, and the maximum shift capacity of passengers in a time zone is worked out and the form is obtained. Then the minimum times of starting bus in this model is calculated by linear programming according to the maximum shift capacity of passengers. Plus the condition of the waiting time of passengers the times of starting bus in a time zone is worked out, and then the minimum buses is determined by the bus scheduling form. At the end of the article the result is evaluated, and the characteristics of this model is introduced, and the direction of further Optimization is pointed out.
Key words：bus scheduling; time zone; algorithm
