TY - JOUR

T1 - HyperSPAM

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

AU - Caraffini, F.

AU - Neri, F.

AU - Epitropakis, M.

PY - 2019/3/1

Y1 - 2019/3/1

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

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

KW - Adaptive operator selection

KW - Automated design of algorithms

KW - Hyper-heuristics

KW - Memetic computing

KW - Optimization algorithms

KW - Budget control

KW - Covariance matrix

KW - Evolutionary algorithms

KW - Heuristic methods

KW - Learning algorithms

KW - Adaptive operator selections

KW - Automated design

KW - Optimization

U2 - 10.1016/j.ins.2018.10.033

DO - 10.1016/j.ins.2018.10.033

M3 - Journal article

VL - 477

SP - 186

EP - 202

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

ER -