期刊名称：IAENG International Journal of Computer Science
印刷版ISSN：1819-656X
电子版ISSN：1819-9224
出版年度：2021
卷号：48
期号：4
语种：English
出版社：IAENG - International Association of Engineers
摘要：This paper presents a metaheuristic with online learning (MOL) to solve the multi-school heterogeneous-fleet school bus routing problem (MHSBRP). In the iterated local search (ILS) metaheuristic framework, an online learning mechanism is integrated with the neighborhood search heuristic. It evaluates the performance of search operators according to the historical search information, and then adjusts the selection probability of the operators in the following loops of search. The proposed algorithm is tested on a set of benchmark instances. The solution results show that MOL solves both mixed-load and single-load instances of MHSBRP effectively, and outperforms the ILS significantly. Compared with the algorithm without learning mechanism, MOL could improve the convergence of neighborhood search and the quality of solution.
关键词：Metaheuristic;online learning;multi-school heterogeneous-fleet;school bus routing problem
