Show simple item record

dc.contributor.authorCaraffini, Fabioen
dc.contributor.authorNeri, Ferranteen
dc.contributor.authorIacca, Giovannien
dc.contributor.authorMol, A.en
dc.date.accessioned2013-02-27T16:03:59Z
dc.date.available2013-02-27T16:03:59Z
dc.date.issued2013-04
dc.identifier.citationCaraffini, F., Neri, F., Iacca, G. and Mol, A. (2013) Parallel Memetic Structures. Information Sciences, 227, pp 60-82en
dc.identifier.issn0020-0255
dc.identifier.urihttp://hdl.handle.net/2086/8197
dc.description.abstractMemetic Computing (MC) structures are algorithms composed of heterogeneous operators (memes) for solving optimization problems. In order to address these problems, this study investigates and proposes a simple yet extremely efficient structure, namely Parallel Memetic Structure (PMS). PMS is a single solution optimization algorithm composed of tree operators, the first one being a stochastic global search which explores the entire decision space searching for promising regions. In analogy with electrical networks, downstream of the global search component there is a parallel of two alternative elements, i.e. two local search algorithms with different features in terms of search logic, whose purpose is to refine the search in the regions detected by the upstream element. The first local search explores the space along the axes, while the second performs diagonal movements in the direction of the estimated gradient. The PMS algorithm, despite its simplicity, displays a respectable performance compared to that of popular meta-heuristics and modern optimization algorithms representing the state-of-the-art in the field. Thanks to its simple structure, PMS appears to be a very flexible algorithm for various problem features and dimensionality values. Unlike modern complex algorithm that are specialized for some benchmarks and some dimensionality values, PMS achieves solutions with a high quality in various and diverse contexts, for example both on low dimensional and large scale problems. An application example in the field of magnetic sensors further proves the potentials of the proposed approach. This study confirms the validity of the Ockham’s Razor in MC: efficiently designed simple structures can perform as well as (if not better than) complex algorithms composed of many parts.en
dc.language.isoenen
dc.publisherElsevieren
dc.subjectMemetic computingen
dc.subjectMemetic algorithmen
dc.subjectLocal search algorithmen
dc.subjectRosenbrock algorithmen
dc.subjectContinuous optimizationen
dc.titleParallel Memetic Structuresen
dc.typeArticleen
dc.identifier.doihttp://dx.doi.org/10.1016/j.ins.2012.11.017
dc.researchgroupCentre for Computational Intelligenceen
dc.researchinstituteInstitute of Artificial Intelligence (IAI)en


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record