| The scheduling planning of school bus is an important link in the process of school bus operation.Compared with the traditional school bus scheduling planning based on experience,it is more scientific and reasonable to make it by mathematical modeling.Based on the traveling salesman problem,the mathematical model of school bus scheduling and planning problem is established and solved by ant colony algorithm.In this paper,the improved ant colony algorithm is used to solve the traveling salesman problem and the school bus scheduling problem.Firstly,this paper proposes an improved ant colony algorithm to solve the traveling salesman problem by analyzing the solution of the classical ant colony algorithm.In order to obtain the optimal solution with greater probability in solving the traveling salesman problem,the solution time of the algorithm is relatively short.We have improved the pheromone concentration updating rule and path selection probability,carried out local search on the optimal path,optimized the algorithm’s solving process,and rationalized the parameters through experiments.Through the performance simulation analysis,the algorithm proposed in this paper has higher precision and shorter solving time.Secondly,this article through the analysis of the school bus schedule planning,set on the school bus or take a site planning,through clustering method is combined with the actual situation of students’ home address involution on site planning,combining with the actual situation of road traffic of algorithm to get close to a certain extent by site adjustment,finally gives a reasonable bus by site.Finally,this paper studies the modeling and solution of the school bus route planning problem.On the basis of the traveling salesman problem,the constraint condition of the stopping time of the station is increased,the total running time is taken as the objective function,the city traffic route is divided,according to the planning of the bus station,the number and time of the school bus,the specific school bus scheduling is given. |