摘要
The paper deals with the vehicle scheduling problem related to regional public transport. Linear programming methods are used to solve the problem. A mathematical model is created including the constraints and the objective function minimizing costs and the number of vehicles. A minimum costs and a number of vehicles are forced at the same time by special economical input data analysis and an allocation of costs. Determining of the costs coefficients is done by three methods, which differs primarily by how much of the total costs they take into account. The decomposition of the set of lines into disjoint subsets can be used instead of the ＂direct＂ optimization. The decomposition has proven to be a suitable alternative in solving large optimization problems. The problem was applied to optimize vehicle scheduling in the region, which is situated in the north-east of the Czech Republic. There is used Xpress-IVE software, which solve the problem by simplex algorithm and branch and bound method. Research results show that there are large reserves in the organization of public transport. The implementation of the new vehicle scheduling would bring significant costs reductions in amount of at least 10% for the optimal solution and in amount of about 10% for the decomposition solution. The number of drivers could be decreased and the total time of the vehicles being outside the garage could be also reduced by at least 10%.
