Skip to main content

Research Repository

Advanced Search

HyperSPAM: A study on hyper-heuristic coordination strategies in the continuous domain

Caraffini, Fabio; Neri, Ferrante; Epitropakis, Michael

HyperSPAM: A study on hyper-heuristic coordination strategies in the continuous domain Thumbnail


Authors

Fabio Caraffini

Ferrante Neri

Michael Epitropakis



Abstract

© 2018 Elsevier Inc. This article proposes a simplistic algorithmic framework, namely hyperSPAM, composed of three search algorithms for addressing continuous optimisation problems. The Covariance Matrix Adaptation Evolution Strategy (CMAES) is activated at the beginning of the optimisation process as a preprocessing component for a limited budget. Subsequently, the produced solution is fed to the other two single-solution search algorithms. The first performs moves along the axes while the second makes use of a matrix orthogonalization to perform diagonal moves. Four coordination strategies, in the fashion of hyperheuristics, have been used to coordinate the two single-solution algorithms. One of them is a simple randomized criterion while the other three are based on a success based reward mechanism. The four implementations of the hyperSPAM framework have been tested and compared against each other and modern metaheuristics on an extensive set of problems including theoretical functions and real-world engineering problems. Numerical results show that the different versions of the framework display broadly a similar performance. One of the reward schemes appears to be marginally better than the others. The simplistic random coordination also displays a very good performance. All the implementations of hyperSPAM significantly outperform the other algorithms used for comparison.

Citation

Caraffini, F., Neri, F., & Epitropakis, M. (2019). HyperSPAM: A study on hyper-heuristic coordination strategies in the continuous domain. Information Sciences, 477, 186-202. https://doi.org/10.1016/j.ins.2018.10.033

Journal Article Type Article
Acceptance Date Oct 23, 2018
Online Publication Date Oct 23, 2018
Publication Date Mar 1, 2019
Deposit Date Mar 31, 2020
Publicly Available Date Apr 2, 2020
Journal Information Sciences
Print ISSN 0020-0255
Electronic ISSN 1872-6291
Publisher Elsevier
Peer Reviewed Peer Reviewed
Volume 477
Pages 186-202
DOI https://doi.org/10.1016/j.ins.2018.10.033
Public URL https://nottingham-repository.worktribe.com/output/3705331
Publisher URL https://www.sciencedirect.com/science/article/pii/S002002551830851X?via%3Dihub

Files





Downloadable Citations