期刊名称：IAENG International Journal of Computer Science
印刷版ISSN：1819-656X
电子版ISSN：1819-9224
出版年度：2020
卷号：47
期号：4
语种：English
出版社：IAENG - International Association of Engineers
摘要：In practice of school bus route planning, the bus fleet usually consists of a number of buses with different capacities, purchase costs and operation costs. However, the heterogeneous fleet school bus routing problem (HSBRP), especially for the problem with a limited fleet, has not been sufficiently investigated so far. This study deals with the HSBRP with unlimited fleet as well as limited fleet. The objective is to design a set of routes in such a way that the sum of fixed and variable costs is minimized. A metaheuristic algorithm for the HSBRP is proposed by hybridizing iterated local search (ILS) heuristic with a set partitioning (SP) procedure. The historical routes identified by ILS local search are globally selected by solving a set partitioning problem. The experimental results show that the proposed algorithm is quite effective and efficient. Furthermore, when the algorithm is applied to the routes plan of several real schools in china, it can obtain better school bus route planning solution and reduce the transportation costs.
关键词：heterogeneous fleet;iterated local search;set partitioning;real case;school bus routing problem
