Towards many-objective optimisation with hyper-heuristics: Identifying good heuristics with indicators

9Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The use of hyper-heuristics is increasing in the multiobjective optimisation domain, and the next logical advance in such methods is to use them in the solution of many-objective problems. Such problems comprise four or more objectives and are known to present a significant challenge to standard dominance-based evolutionary algorithms. We incorporate three comparison operators as alternatives to dominance and investigate their potential to optimise many-objective problems with a hyper-heuristic from the literature. We discover that the best results are obtained using either the favour relation or hypervolume, but conclude that changing the comparison operator alone will not allow for the generation of estimated Pareto fronts that are both close to and fully cover the true Pareto front.

Cite

CITATION STYLE

APA

Walker, D. J., & Keedwell, E. (2016). Towards many-objective optimisation with hyper-heuristics: Identifying good heuristics with indicators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9921 LNCS, pp. 493–502). Springer Verlag. https://doi.org/10.1007/978-3-319-45823-6_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free