期刊名称：IAENG International Journal of Computer Science
印刷版ISSN：1819-656X
电子版ISSN：1819-9224
出版年度：2019
卷号：46
期号：3
页码：409-416
出版社：IAENG - International Association of Engineers
摘要：This paper deals with the school bus routing problem (SBRP) while satisfying with bus capacity and student travel time constraints. The objective is to minimize the number of school buses as well as the total travel distance. A hybrid metaheuristic, which is combined iterated local search (ILS) with set partitioning procedure (SP), is proposed for this bi-objective problem. An SP model is built by the routes which are generated in the execution of ILS, and then the model is solved by the optimization software CPLEX. In the local search of ILS, four neighborhood operators are sequentially executed to improve the solution, and the routes of the improved solution and the best local optimization obtained every iteration are both put into the route pool. To keep the diversification of the local search, an effective perturbation method based on ruin and recreate is also adopted. The developed algorithm was tested on the benchmark instances. The results show that the proposed algorithm is effective.
关键词：school bus routing problem; bi;objective; iterated local search; set partitioning; hybrid metaheuristic
