2020
DOI: 10.1007/978-3-030-58115-2_44
|View full text |Cite
|
Sign up to set email alerts
|

Analysis on the Efficiency of Multifactorial Evolutionary Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 22 publications
0
5
0
Order By: Relevance
“…Evolutionary multitasking builds on the notion of related tasks sharing reusable building-blocks of knowledge, harnessing the rich body of information gathered while optimizing tasks within the same domain [47,48]. By transferring useful information across joint optimization processes, it becomes possible to simplify the search, thus speeding up convergence rates to near-optimal solutions [49,50].…”
Section: One-pass Neuroevolutionary Multitaskingmentioning
confidence: 99%
“…Evolutionary multitasking builds on the notion of related tasks sharing reusable building-blocks of knowledge, harnessing the rich body of information gathered while optimizing tasks within the same domain [47,48]. By transferring useful information across joint optimization processes, it becomes possible to simplify the search, thus speeding up convergence rates to near-optimal solutions [49,50].…”
Section: One-pass Neuroevolutionary Multitaskingmentioning
confidence: 99%
“…This theoretical result indicates that MTEC is probably a promising approach to deal with some distinct problems in the field of evolutionary computation. The proposed MFEA algorithm is further analyzed on several benchmark pseudo-Boolean functions [47]. Theoretical analysis results show that, by properly setting the parameter rmp for the group of problems with similar tasks, the upper bound of expected runtime of (4 + 2) MFEA on the harder task can be improved to be the same as on the easier one, while for the group of problems with dissimilar tasks, the expected upper bound of (4 + 2) MFEA on each task are the same as that of solving them independently.…”
Section: Theoretical Analyses Of Multi-task Evolutionary Computationmentioning
confidence: 99%
“…On the other hand, the researchers and practitioners ignore further study on the theoretic analysis of MTO and MTEC, either consciously or unconsciously. The most representative results focused on convergence performance [37,41] and time complexity [46,47] of simplified MFEA, which theoretically explains the superiority of the MTEC algorithm compared with traditional single-task EAs. Comparatively speaking, other theoretical analysis (stability, diversity, etc.)…”
Section: Balance Theoretical Analysis and Practical Applicationmentioning
confidence: 99%
“…Adaptive: [9,12,18,28,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70] [ 20,27,31,74,75,76,77,78,79,80,81,…”
Section: Staticmentioning
confidence: 99%
“…As part of the work carried out, there are several published papers that have also delved into theoretical aspects of these paradigms. In the recent [35], for example, an analysis on the efficiency of MFEA is carried out. Main objectives of that study are twofold: to theoretically unveil why MFEA based methods perform better that classical techniques, and to provide some findings on the parameter setup of MFEA algorithm.…”
Section: Staticmentioning
confidence: 99%