Libin Hong
Automatically designing more general mutation operators of Evolutionary Programming for groups of function classes using a hyper-heuristic
Hong, Libin; Drake, John H.; Woodward, John R.; Özcan, Ender
Authors
John H. Drake
John R. Woodward
Professor Ender Ozcan ender.ozcan@nottingham.ac.uk
PROFESSOR OF COMPUTER SCIENCE AND OPERATIONAL RESEARCH
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.
Citation
Hong, L., Drake, J. H., Woodward, J. R., & Özcan, E. (2016, July). Automatically designing more general mutation operators of Evolutionary Programming for groups of function classes using a hyper-heuristic. Presented at The Genetic and Evolutionary Computation Conference (GECCO 2016), Denver, Colorado, USA
Presentation Conference Type | Edited Proceedings |
---|---|
Conference Name | The Genetic and Evolutionary Computation Conference (GECCO 2016) |
Start Date | Jul 20, 2016 |
End Date | Jul 24, 2016 |
Acceptance Date | Mar 20, 2016 |
Publication Date | Jul 20, 2016 |
Deposit Date | Aug 4, 2016 |
Publicly Available Date | Aug 4, 2016 |
Peer Reviewed | Peer Reviewed |
Pages | 725-732 |
Book Title | Proceedings of the 2016 on Genetic and Evolutionary Computation Conference - GECCO '16 |
ISBN | 9781450342063 |
DOI | https://doi.org/10.1145/2908812.2908958 |
Public URL | https://nottingham-repository.worktribe.com/output/800167 |
Publisher URL | http://dl.acm.org/citation.cfm?doid=2908812.2908958 |
Contract Date | Aug 4, 2016 |
Files
gecco2016.pdf
(328 Kb)
PDF
Copyright Statement
Copyright information regarding this work can be found at the following address: http://creativecommons.org/licenses/by-nc-nd/4.0
You might also like
CUDA-based parallel local search for the set-union knapsack problem
(2024)
Journal Article
A benchmark dataset for multi-objective flexible job shop cell scheduling
(2023)
Journal Article
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: discovery-access-systems@nottingham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search