Automatically designing more general mutation operators of evolutionary programming for groups of function classes using a hyper-heuristic

Hong, Libin and Drake, John H. and 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.

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Available under Licence Creative Commons Attribution Non-commercial No Derivatives.
Download (328kB) | Preview

Abstract

In 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.

Item Type: Conference or Workshop Item (Paper)
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.1145/2908812.2908958
Depositing User: Ozcan, Dr Ender
Date Deposited: 04 Aug 2016 11:12
Last Modified: 17 Sep 2016 12:02
URI: http://eprints.nottingham.ac.uk/id/eprint/35701

Actions (Archive Staff Only)

Edit View Edit View