Show simple item record

dc.contributor.authorCaraffini, Fabioen
dc.contributor.authorNeri, Ferranteen
dc.contributor.authorEpitropakis, Michael G.en
dc.date.accessioned2018-10-25T13:20:50Z
dc.date.available2018-10-25T13:20:50Z
dc.date.issued2018-10-23
dc.identifier.citationCaraffini, F., Neri, F., Epitropakis, M.G. (2018) HyperSPAM: A study on Hyper-heuristic Coordination Strategies in the Continuous Domain. Information Sciences, 477, pp. 186-202en
dc.identifier.issn0020-0255
dc.identifier.urihttp://hdl.handle.net/2086/16841
dc.descriptionThe file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.en
dc.description.abstractThis 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.en
dc.language.isoenen
dc.publisherElsevieren
dc.subjectAutomated design of algorithmsen
dc.subjectHyper-heuristicsMemetic computingen
dc.subjectOptimization algorithmsen
dc.subjectAdaptive Operator Selectionen
dc.titleHyperSPAM: A study on hyper-heuristic coordination strategies in the continuous domainen
dc.typeArticleen
dc.identifier.doihttps://doi.org/10.1016/j.ins.2018.10.033
dc.researchgroupInstitute of Artificial Intelligence (IAI)en
dc.peerreviewedYesen
dc.funderN/Aen
dc.projectidN/Aen
dc.cclicenceCC-BY-NCen
dc.date.acceptance2018-10-23en
dc.researchinstituteInstitute of Artificial Intelligence (IAI)en


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record