A generality analysis of multiobjective hyper-heuristics

Abstract

Selection hyper-heuristics have emerged as high level general-purpose search methodologies that mix and control a set of low-level (meta) heuristics. Previous empirical studies over a range of single objective optimisation problems have shown that the number and type of low-level (meta) heuristics used are influential to the performance of selection hyper-heuristics. In addition, move acceptance strategies play an important role and can significantly affect the overall performance of a hyper-heuristic. In this paper, we introduce an adapted variant of an existing learning automata based multiobjective hyper-heuristic from the literature. We investigate the performance and generality level of the proposed method, and another learning automata based selection hyper-heuristic, operating over a search space of multiobjective evolutionary algorithms (MOEAs) across two well-known multiobjective optimisation benchmarks. The experimental results demonstrate that, regardless of the number and type of low-level metaheuristics available, the learning automata based hyper-heuristics outperform each constituent MOEA individually, and an online learning and random choice selection hyper-heuristic from the literature. This performance and generality is shown to be consistent across a number of different move acceptance strategies.