@incollection{poliThereFreeLunch2009,
  title = {There {{Is}} a {{Free Lunch}} for {{Hyper}}-{{Heuristics}}, {{Genetic Programming}} and {{Computer Scientists}}},
  booktitle = {Genetic {{Programming}}},
  author = {Poli, Riccardo and Graff, Mario},
  editor = {Vanneschi, Leonardo and Gustafson, Steven and Moraglio, Alberto and De Falco, Ivanoe and Ebner, Marc},
  date = {2009},
  volume = {5481},
  pages = {195--207},
  publisher = {{Springer Berlin Heidelberg}},
  location = {{Berlin, Heidelberg}},
  doi = {10.1007/978-3-642-01181-8\\_17},
  url = {https://doi.org/10.1007/978-3-642-01181-8_17},
  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.},
  isbn = {978-3-642-01180-1},
  keywords = {*imported-from-citeulike-INRMM,~INRMM-MiD:c-9293194,computational-science,genetic-algorithms,heuristics,hyper-heuristics,no-free-lunch-theorem},
  series = {Lecture {{Notes}} in {{Computer Science}}}
}

{"_id":"E4f5EcWuXQq6NqHra","bibbaseid":"poli-graff-thereisafreelunchforhyperheuristicsgeneticprogrammingandcomputerscientists","authorIDs":[],"author_short":["Poli, R.","Graff, M."],"bibdata":{"bibtype":"incollection","type":"incollection","title":"There Is a Free Lunch for Hyper-Heuristics, Genetic Programming and Computer Scientists","booktitle":"Genetic Programming","author":[{"propositions":[],"lastnames":["Poli"],"firstnames":["Riccardo"],"suffixes":[]},{"propositions":[],"lastnames":["Graff"],"firstnames":["Mario"],"suffixes":[]}],"editor":[{"propositions":[],"lastnames":["Vanneschi"],"firstnames":["Leonardo"],"suffixes":[]},{"propositions":[],"lastnames":["Gustafson"],"firstnames":["Steven"],"suffixes":[]},{"propositions":[],"lastnames":["Moraglio"],"firstnames":["Alberto"],"suffixes":[]},{"propositions":[],"lastnames":["De","Falco"],"firstnames":["Ivanoe"],"suffixes":[]},{"propositions":[],"lastnames":["Ebner"],"firstnames":["Marc"],"suffixes":[]}],"date":"2009","volume":"5481","pages":"195–207","publisher":"Springer Berlin Heidelberg","location":"Berlin, Heidelberg","doi":"10.1007/978-3-642-01181-8\\_17","url":"https://doi.org/10.1007/978-3-642-01181-8_17","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.","isbn":"978-3-642-01180-1","keywords":"*imported-from-citeulike-INRMM,~INRMM-MiD:c-9293194,computational-science,genetic-algorithms,heuristics,hyper-heuristics,no-free-lunch-theorem","series":"Lecture Notes in Computer Science","bibtex":"@incollection{poliThereFreeLunch2009,\n title = {There {{Is}} a {{Free Lunch}} for {{Hyper}}-{{Heuristics}}, {{Genetic Programming}} and {{Computer Scientists}}},\n booktitle = {Genetic {{Programming}}},\n author = {Poli, Riccardo and Graff, Mario},\n editor = {Vanneschi, Leonardo and Gustafson, Steven and Moraglio, Alberto and De Falco, Ivanoe and Ebner, Marc},\n date = {2009},\n volume = {5481},\n pages = {195--207},\n publisher = {{Springer Berlin Heidelberg}},\n location = {{Berlin, Heidelberg}},\n doi = {10.1007/978-3-642-01181-8\\\\_17},\n url = {https://doi.org/10.1007/978-3-642-01181-8_17},\n 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.},\n isbn = {978-3-642-01180-1},\n keywords = {*imported-from-citeulike-INRMM,~INRMM-MiD:c-9293194,computational-science,genetic-algorithms,heuristics,hyper-heuristics,no-free-lunch-theorem},\n series = {Lecture {{Notes}} in {{Computer Science}}}\n}\n\n","author_short":["Poli, R.","Graff, M."],"editor_short":["Vanneschi, L.","Gustafson, S.","Moraglio, A.","De Falco, I.","Ebner, M."],"key":"poliThereFreeLunch2009","id":"poliThereFreeLunch2009","bibbaseid":"poli-graff-thereisafreelunchforhyperheuristicsgeneticprogrammingandcomputerscientists","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-642-01181-8_17"},"keyword":["*imported-from-citeulike-INRMM","~INRMM-MiD:c-9293194","computational-science","genetic-algorithms","heuristics","hyper-heuristics","no-free-lunch-theorem"],"downloads":0},"bibtype":"incollection","biburl":"https://tmpfiles.org/dl/58794/INRMM.bib","creationDate":"2020-07-02T22:41:18.795Z","downloads":0,"keywords":["*imported-from-citeulike-inrmm","~inrmm-mid:c-9293194","computational-science","genetic-algorithms","heuristics","hyper-heuristics","no-free-lunch-theorem"],"search_terms":["free","lunch","hyper","heuristics","genetic","programming","computer","scientists","poli","graff"],"title":"There Is a Free Lunch for Hyper-Heuristics, Genetic Programming and Computer Scientists","year":null,"dataSources":["DXuKbcZTirdigFKPF"]}