There Is a Free Lunch for Hyper-Heuristics, Genetic Programming and Computer Scientists

  • Authors:
  • Riccardo Poli;Mario Graff

  • Affiliations:
  • School of Computer Science and Electronic Engineering, University of Essex, UK;School of Computer Science and Electronic Engineering, University of Essex, UK

  • Venue:
  • EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we prove that in some practical situations, there is a free lunch for hyper-heuristics, i.e., for search algorithms that search the space of solvers, searchers, meta-heuristics and heuristics for problems. This has consequences for the use of genetic programming as a method to discover new search algorithms and, more generally, problem solvers. Furthermore, it has also rather important philosophical consequences in relation to the efforts of computer scientists to discover useful novel search algorithms.