基于校车数量的无混载校车路线问题模型优化实现

Optimization of the Model of Unmixed School Bus Route Based on the Number of School Bus

校车是我国中小学生上下学的重要交通工具,在日常生活中起着至关重要的作用.在校车运营服务中需要顾及学生的乘车时间,并且优化目标还要兼顾所需校车的数量和校车的行驶距离.SBRP(school bus routing problem)算法为校车寻找最佳行驶路线,在满足各种限制条件的同时缩短了校车行驶距离.为了优化所需校车数量,降低校车运营成本,建立了基于校车数量限制的无混载校车路径问题的数学模型,并进行算法求解.通过实验验证,该算法显著减少了所需校车数量,获得较好的校车路径规划方案.

The school bus is an important means of transportation for primary and secondary school students in China,which plays a vital role in daily life.In the school bus operation service,it is necessary to take into account the students’travel time,the number of school buses required and the distance traveled by the school bus.SBRP algorithm finds the best driving route for the school bus.Each bus can meet various restrictions and send students from the boarding point to the school,which shortens the distance of school bus.In order to optimize the number of school buses and reduce the operating cost of school bus,a mathematical model of the unmixed school bus routing based on the number of school buses was established,and an algorithm was proposed.The experimental results show that the algorithm significantly reduces the number of school buses required and can obtain a better school bus route planning scheme.