Libin Hong
Hyper-heuristic approach: automatically designing adaptive mutation operators for evolutionary programming
Hong, Libin; Woodward, John R.; Özcan, Ender; Liu, Fuchang
Authors
John R. Woodward
ENDER OZCAN ender.ozcan@nottingham.ac.uk
Professor of Computer Science and Operational Research
Fuchang Liu
Abstract
Genetic programming (GP) automatically designs programs. Evolutionary programming (EP) is a real-valued global optimisation method. EP uses a probability distribution as a mutation operator, such as Gaussian, Cauchy, or Lévy distribution. This study proposes a hyper-heuristic approach that employs GP to automatically design different mutation operators for EP. At each generation, the EP algorithm can adaptively explore the search space according to historical information. The experimental results demonstrate that the EP with adaptive mutation operators, designed by the proposed hyper-heuristics, exhibits improved performance over other EP versions (both manually and automatically designed). Many researchers in evolutionary computation advocate adaptive search operators (which do adapt over time) over non-adaptive operators (which do not alter over time). The core motive of this study is that we can automatically design adaptive mutation operators that outperform automatically designed non-adaptive mutation operators.
Citation
Hong, L., Woodward, J. R., Özcan, E., & Liu, F. (2021). Hyper-heuristic approach: automatically designing adaptive mutation operators for evolutionary programming. Complex and Intelligent Systems, 7(6), 3135-3163. https://doi.org/10.1007/s40747-021-00507-6
Journal Article Type | Article |
---|---|
Acceptance Date | Aug 12, 2021 |
Online Publication Date | Aug 28, 2021 |
Publication Date | Dec 1, 2021 |
Deposit Date | Dec 2, 2021 |
Publicly Available Date | Dec 13, 2021 |
Journal | Complex and Intelligent Systems |
Print ISSN | 2199-4536 |
Electronic ISSN | 2198-6053 |
Publisher | Springer Science and Business Media LLC |
Peer Reviewed | Peer Reviewed |
Volume | 7 |
Issue | 6 |
Pages | 3135-3163 |
DOI | https://doi.org/10.1007/s40747-021-00507-6 |
Keywords | General Earth and Planetary Sciences; General Environmental Science |
Public URL | https://nottingham-repository.worktribe.com/output/6847178 |
Publisher URL | https://link.springer.com/article/10.1007/s40747-021-00507-6 |
Files
Hyper-heuristic approach: automatically designing adaptive mutation operators for evolutionary programming
(1.9 Mb)
PDF
Publisher Licence URL
https://creativecommons.org/licenses/by/4.0/
You might also like
A benchmark dataset for multi-objective flexible job shop cell scheduling
(2023)
Journal Article
An adaptive greedy heuristic for large scale airline crew pairing problems
(2023)
Journal Article
ML meets MLn: machine learning in ligand promoted homogeneous catalysis
(2023)
Journal Article
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: digital-library-support@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 © 2024
Advanced Search