Automatically designing more general mutation operators of evolutionary programming for groups of function classes using a hyper-heuristicTools Hong, Libin, Drake, John H., Woodward, John R. and Özcan, Ender (2016) Automatically designing more general mutation operators of evolutionary programming for groups of function classes using a hyper-heuristic. In: The Genetic and Evolutionary Computation Conference (GECCO 2016), 24-24 July 2016, Denver, Colorado. Full text not available from this repository.
Official URL: http://dl.acm.org/citation.cfm?doid=2908812.2908958
AbstractIn this study we use Genetic Programming (GP) as an offline hyper-heuristic to evolve a mutation operator for Evolutionary Programming. This is done using the Gaussian and uniform distributions as the terminal set, and arithmetic operators as the function set. The mutation operators are automatically designed for a specific function class. The contribution of this paper is to show that a GP can not only automatically design a mutation operator for Evolutionary Programming (EP) on functions generated from a specific function class, but also can design more general mutation operators on functions generated from groups of function classes. In addition, the automatically designed mutation operators also show good performance on new functions generated from a specific function class or a group of function classes.
Actions (Archive Staff Only)
|
Tools
Tools
