Toward Adaptive Knowledge Transfer in Multifactorial Evolutionary Computation
The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Abstract
A multifactorial evolutionary algorithm (MFEA) is a recently proposed algorithm for evolutionary multitasking, which optimizes multiple optimization tasks simultaneously. With the design of knowledge transfer among different tasks, MFEA has demonstrated the capability to outperform its single-task counterpart in terms of both convergence speed and solution quality. In MFEA, the knowledge transfer across tasks is realized via the crossover between solutions that possess different skill factors. This crossover is thus essential to the performance of MFEA. However, we note that the present MFEA and most of its existing variants only employ a single crossover for knowledge transfer, and fix it throughout the evolutionary search process. As different crossover operators have a unique bias in generating offspring, the appropriate configuration of crossover for knowledge transfer in MFEA is necessary toward robust search performance, for solving different problems. Nevertheless, to the best of our knowledge, there is no effort being conducted on the adaptive configuration of crossovers in MFEA for knowledge transfer, and this article thus presents an attempt to fill this gap. In particular, here, we first investigate how different types of crossover affect the knowledge transfer in MFEA on both single-objective (SO) and multiobjective (MO) continuous optimization problems. Furthermore, toward robust and efficient multitask optimization performance, we propose a new MFEA with adaptive knowledge transfer (MFEA-AKT), in which the crossover operator employed for knowledge transfer is self-adapted based on the information collected along the evolutionary search process. To verify the effectiveness of the proposed method, comprehensive empirical studies on both SO and MO multitask benchmarks have been conducted. The experimental results show that the proposed MFEA-AKT is able to identify the appropriate knowledge transfer crossover for different optimization problems and even at different optimization stages along the search, which thus leads to superior or competitive performances when compared to the MFEAs with fixed knowledge transfer crossover operators.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237 · cited 1×
“As indicated by the theory of “no free lunch” [36], there is no single crossover for knowledge transfer that can perform well on all the benchmark tasks.”
BackgroundGenetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1996) · Springer eBooks · doi:10.1007/978-3-662-03315-9 · Cited by 5,095 · cited 1×
“Examples of ABCOs include arithmetical crossover [45], geometrical crossover [46], linear crossover (LX) [47], etc.”
BackgroundSimulated Binary Crossover for Continuous Search Space.
Deb, K., & Agrawal, R. B. (1995) · Complex Systems · Cited by 2,976
Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II
Li, H., & Zhang, Q. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.925798 · Cited by 2,543 · cited 2×
“Particularly, to construct the new complex multitask problems, the individual functions F 7 ( x ) − F 16 ( x ) of the CEC2014 SO test suites [37] and F 1 − F 9 of the LZ09 MO benchmarks [38], which are more complex than tasks in the common multitask benchmarks, are utilized in this article.”
MethodSrinivas, M., & Patnaik, L. M. (1994) · Computer · doi:10.1109/2.294849 · Cited by 2,180 · cited 1×
“For instance, the one-and two-point crossover [21], [22]; uniform crossover [23], [24]; simulated binary crossover (SBX) [25], [26]; etc., have been introduced to solve continuous optimization problems, while the order crossover (OX) [27], [28]; partially mapped crossover (PMX) [29], [30]; etc.,…”
BackgroundUniform crossover in genetic algorithms
Syswerda, G. (1989) · international conference on Genetic algorithms · Cited by 1,965
Alleles, loci and the traveling salesman problem
Goldberg, D. E., & Lingle, R. (1985) · international conference on Genetic algorithms · Cited by 1,700
Real-Coded Genetic Algorithms and Interval-Schemata
Eshelman, L. J., & Schaffer, J. D. (1993) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-094832-4.50018-0 · Cited by 1,650
Normalization: A Preprocessing Stage
Patro, S. G. K., & sahu, K. K. (2015) · IARJSET · doi:10.17148/iarjset.2015.2305 · Cited by 1,566
Cited by
Zhang, F., Mei, Y., Nguyen, S., Zhang, M., & Tan, K. C. (2021) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2021.3065707 · Cited by 233
“Evolutionary multitasking has been successfully applied to solve different problems such as continuous numeric optimisation [33], [34], [35], symbolic regression [36] and job shop scheduling [37], [38].”
MethodSelf-citation
Metadata
- Authors
- Zhou, L., Feng, L., Tan, K. C., Zhong, J., Zhu, Z., Liu, K., & Chen, C.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2021-05
- Volume
- 51
- Issue
- 5
- Pages
- 2563-2576
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W3010117582
- Cited by
- 249
- References
- 37
- FWCI
- 12.50
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Toward Adaptive Knowledge Transfer in Multifactorial Evolutionary Computation. https://app.cochat.ai/papers/10.1109/tcyb.2020.2974100
- The paper
- Zhou, L., Feng, L., Tan, K. C., Zhong, J., Zhu, Z., Liu, K., & Chen, C. (2021). Toward Adaptive Knowledge Transfer in Multifactorial Evolutionary Computation. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2020.2974100
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.