The No Free Lunch Theorem states that, averaged over all optimisation problems, all non-resampling optimisation algorithms perform equally well. In order to explain the relevance of these theorems for metaheuristic optimisation, we present a detailed discussion on the No Free Lunch Theorem, and various extensions including some which have not appeared in the literature so far. We then show that understanding the No Free Lunch theorems brings us to a position where we can ask about the specific dynamics of an optimisation algorithm, and how those dynamics relate to the properties of optimisation problems.
CITATION STYLE
Joyce, T., & Herrmann, J. M. (2018). A review of no free lunch theorems, and their implications for metaheuristic optimisation. In Studies in Computational Intelligence (Vol. 744, pp. 27–51). Springer Verlag. https://doi.org/10.1007/978-3-319-67669-2_2
Mendeley helps you to discover research relevant for your work.