Подробное описание документа
Karpenko A. P
New Adaptive Multi-Memetic Global Optimization Agorithm / Karpenko A. P, Sakharov M. K. - URL: https://vestniken.bmstu.ru/catalog/math/diff/864.html (дата обращения: 11.03.2026). - DOI 10.18698/1812-3368-2019-2-17-31 // Вестник МГТУ им. Н. Э. Баумана. Сер. Естественные науки. - 2019. - № 2. -
This paper deals with the Simple MEC (SMEC) algorithm which belongs to a class of MEC algorithms. The algorithm was selected for investigation due to the following reasons: nowadays this algorithm and its modifications are successfully used for solving various optimization problems; the algorithm is highly suitable for parallel computations, especially for loosely coupled systems; the algorithm is not sufficiently studied — there are relatively few modifications of SMEC (while, for instance, tens of various modifications are known for particle swarm optimization). Authors proposed an adaptive multi-memetic modification of SMEC algorithm, which includes a stage of landscape analysis for composing a set of basic adaptation strategies; software implementation of the algorithm is also presented. Performance investigation was carried out with a use of multi-dimensional benchmark functions of different classes. It was demonstrated that the concept of multi-population along with the incorporated landscape analysis procedure allows making a rough static adaptation of the algorithm to the objective function at the very beginning of evolution process at the cost of small computational expenses. Utilization of memes, in turn, helps the algorithm to correct possible errors of static adaptation during the evolution due to a closer investigation of search sub-domains This work was supported by the Russian Foundation for Basic Research (RFBR project no. 16-07-00287)
519.7 Математическая кибернетика