Show simple item record

dc.contributor.authorCaraffini, Fabioen
dc.contributor.authorIacca, Giovannien
dc.contributor.authorNeri, Ferranteen
dc.contributor.authorMininno, Ernestoen
dc.date.accessioned2016-03-30T14:43:51Z
dc.date.available2016-03-30T14:43:51Z
dc.date.issued2012-09
dc.identifier.citationCaraffini, F., Iacca, G., Neri,F. and Mininno, E. (2012) Three variants of three Stage Optimal Memetic Exploration for handling non-separable fitness landscapes. In 12th UK Workshop on Computational Intelligence (UKCI)en
dc.identifier.isbn9781467343916
dc.identifier.urihttp://hdl.handle.net/2086/11726
dc.descriptionThe file attached to this record is the authors final peer reviewed version. The publisher's final version can be found by following the DOI link.en
dc.description.abstractThree Stage Optimal Memetic Exploration (3SOME) is a recently proposed algorithmic framework which sequentially perturbs a single solution by means of three operators. Although 3SOME proved to be extremely successful at handling high-dimensional multi-modal landscapes, its application to non-separable fitness functions present some flaws. This paper proposes three possible variants of the original 3SOME algorithm aimed at improving its performance on non-separable problems. The first variant replaces one of the 3SOME operators, namely the middle distance exploration, with a rotation-invariant Differential Evolution (DE) mutation scheme, which is applied on three solutions sampled in a progressively shrinking search space. In the second proposed mechanism, a micro-population rotation-invariant DE is integrated within the algorithmic framework. The third approach employs the search logic (1+1)-Covariance Matrix Adaptation Evolution Strategy, aka (1+1)-CMA-ES. In the latter scheme, a Covariance Matrix adapts to the landscape during the optimization in order to determine the most promising search directions. Numerical results show that, at the cost of a higher complexity, the three approaches proposed are able to improve upon 3SOME performance for non-separable problems without an excessive performance deterioration in the other problems.en
dc.language.isoen_USen
dc.publisherIEEEen
dc.subjectSeparabilityen
dc.subjectNon-separabilityen
dc.subjectMemetic Computingen
dc.subjectOptimisationen
dc.titleThree variants of three Stage Optimal Memetic Exploration for handling non-separable fitness landscapesen
dc.typeConferenceen
dc.identifier.doihttp://dx.doi.org/10.1109/UKCI.2012.6335767
dc.researchgroupCentre for Computational Intelligence
dc.peerreviewedYesen
dc.fundern/aen
dc.projectidN/Aen
dc.researchinstituteInstitute of Artificial Intelligence (IAI)en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record