Toward Subheuristic Search
Created by W.Langdon from
gp-bibliography.bib Revision:1.8081
- @InProceedings{Keller:2008:WCCIt,
-
author = "R. Keller and R. Poli",
-
title = "Toward Subheuristic Search",
-
booktitle = "Proceedings of the IEEE World Congress on
Computational Intelligence",
-
year = "2008",
-
editor = "Jun Wang",
-
pages = "3148--3155",
-
address = "Hong Kong",
-
month = "1-6 " # jun,
-
organization = "IEEE Computational Intelligence Society",
-
publisher = "IEEE Press",
-
keywords = "genetic algorithms, genetic programming",
-
isbn13 = "978-1-4244-1823-7",
-
file = "EC0695.pdf",
-
DOI = "doi:10.1109/CEC.2008.4631224",
-
abstract = "In previous work, we have introduced an effective,
resource-efficient and self-adapting hyperheuristic
that uses Genetic Programming (GP) as its method of
search in the space of domain-specific metaheuristics.
GP employs user-provided, local heuristics from which
it produces these metaheuristics (MHs). Here, we show
that the hyperheuristic performs even better when
working at the subheuristic level, i.e., when building
MHs from generic components and specific elementary
operations. In particular, this approach supports
efficiency of the better MHs. Specifically, these MHs
do not excessively iterate local search steps, i.e.,
their good performance comes from smart patterns of
calls of the provided, basic components. Also, a
moderate reduction of the maximum allowed MH size does
not reduce performance significantly.",
-
notes = "WCCI 2008 - A joint meeting of the IEEE, the INNS, the
EPS and the IET.",
- }
Genetic Programming entries for
Robert E Keller
Riccardo Poli
Citations