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
Genetic Algorithms for Real Parameter Optimization
Wright, A. H. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50016-1 · Cited by 998 · cited 1×
“Examples of ABCOs include arithmetical crossover [45], geometrical crossover [46], linear crossover (LX) [47], etc.”
BackgroundMultifactorial Evolution: Toward Evolutionary Multitasking
Gupta, A., Ong, Y.-S., & Feng, L. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2458037 · Cited by 993 · cited 7×
“Multifactorial EA (MFEA) was proposed together with MFO in [1], which serves as a particular realization of the MFO paradigm.”
BackgroundMethodInfluentialSelf-citationMultiobjective Multifactorial Optimization in Evolutionary Multitasking
Gupta, A., Ong, Y.-S., Feng, L., & Tan, K. C. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2554622 · Cited by 462 · cited 1×
“Gupta et al. extended the MFEA for multitasking in the domain of multiobjective (MO) optimization [9] and bilevel optimization [7].”
BackgroundSelf-citationSelf-Adaptive Genetic Algorithms with Simulated Binary Crossover
Deb, K., & Beyer, H.-G. (2001) · Evolutionary Computation · doi:10.1162/106365601750190406 · Cited by 437 · 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.,…”
BackgroundMultifactorial Evolutionary Algorithm With Online Transfer Parameter Estimation: MFEA-II
Bali, K. K., Ong, Y.-S., Gupta, A., & Tan, P. S. (2020) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2906927 · Cited by 437 · cited 2×
“More recently, an enhanced MFEA called MFEA-II was presented, which employs an online transfer parameter estimation scheme to dynamically control the extent of knowledge exchange across tasks [16].”
BackgroundMethodA taxonomy for the crossover operator for real-coded genetic algorithms: An experimental study
Herrera, F., Lozano, M., & Sánchez, A. (2003) · International Journal of Intelligent Systems · doi:10.1002/int.10091 · Cited by 389 · cited 4×
“25 [42]. c) Geometrical Crossover: ω = 0 .”
BackgroundInfluentialSelf-adaptive simulated binary crossover for real-parameter optimization
Deb, K., Sindhya, K., & Okabe, T. (2007) · Proceedings of the 9th annual conference on Genetic and evolutionary computation · doi:10.1145/1276958.1277190 · Cited by 338 · cited 1×
“Representative crossovers in this group contain the fuzzy recombination (FR) [48], BLX-α [49], SBX [50], etc.”
BackgroundGeneralized Multitasking for Evolutionary Optimization of Expensive Problems
Ding, J., Yang, C., Jin, Y., & Chai, T. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2785351 · Cited by 277 · cited 1×
“[12] proposed a generalized MFEA called G-MFEA to tackle the”
Evolutionary Multitasking: A Computer Science View of Cognitive Multitasking
Ong, Y.-S., & Gupta, A. (2016) · Cognitive Computation · doi:10.1007/s12559-016-9395-7 · Cited by 250 · cited 1×
“in 2016, for multitask optimization [1], [2].”
Evolutionary Multitasking With Dynamic Resource Allocating Strategy
Gong, M., Tang, Z., Li, H., & Zhang, J. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2893614 · Cited by 177 · cited 1×
“Gong et al. [13] and Wen and Ting [14] integrated resource reallocating strategies into MFEA, which allocated the computational resources according to the complexities 2168-2267 c (cid:2) 2020 IEEE.”
BackgroundLinearized domain adaptation in evolutionary multitasking
Bali, K. K., Gupta, A., Feng, L., Ong, Y. S., & Siew, T. P. (2017) · 2017 IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2017.7969454 · Cited by 168 · cited 1×
“In [11], a linearized domain adaptation strategy was integrated into MFEA to transform the search space of a simple task to the search space of a similar but complex task so that negative transfer can be alleviated.”
MethodSelf-citationYuan, Y., Ong, Y.-S., Gupta, A., Tan, P. S., & Xu, H. (2016) · IEEE Region 10 Conference (TENCON) · doi:10.1109/tencon.2016.7848632 · Cited by 131 · cited 2×
“However, it is worth noting that the existing evolutionary multitasking algorithms [8]–[16] employ a single-and fixed-crossover operator for knowledge transfer, which thus could impede the multitasking when the config-ured crossover does not fit the encountered problems well.”
BackgroundCrossover, Macromutation, and Population-Based Search
Jones, T. (1995) · Cited by 130
Hui, S., & Suganthan, P. N. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2394466 · Cited by 118 · cited 1×
“In the last few decades, a number of crossover operators have been proposed in the literature for a wide range of optimization problems [39]–[41].”
BackgroundA Survey on Crossover Operators
Pavai, G., & Geetha, T. V. (2016) · ACM Computing Surveys · doi:10.1145/3009966 · Cited by 118 · cited 1×
“In the literature, for different optimization problems, many crossover operators with various search capabilities have been proposed [17]–[20].”
BackgroundZhou, L., Feng, L., Zhong, J., Ong, Y.-S., Zhu, Z., & Sha, E. H. ‐. (2016) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci.2016.7850039 · Cited by 115
Self-citationFuzzy Recombination for the Breeder Genetic Algorithm
Voigt, H.-M., Mühlenbein, H., & Cvetković, D. (1995) · Cited by 114
Parting ways and reallocating resources in evolutionary multitasking
Wen, Y.-W., & Ting, C.-K. (2017) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2017.7969596 · Cited by 114 · cited 1×
“Gong et al. [13] and Wen and Ting [14] integrated resource reallocating strategies into MFEA, which allocated the computational resources according to the complexities 2168-2267 c (cid:2) 2020 IEEE.”
BackgroundEvolutionary many-tasking based on biocoenosis through symbiosis: A framework and benchmark problems
Liaw, R.-T., & Ting, C.-K. (2017) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2017.7969579 · Cited by 104 · cited 1×
“Further, Liaw and Ting [10] extended MFEA for solving the many task optimization problems, in”
BackgroundA Group-based Approach to Improve Multifactorial Evolutionary Algorithm
Tang, J., Chen, Y., Deng, Z., Xiang, Y., & Joy, C. P. (2018) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2018/538 · Cited by 83 · cited 1×
“Tang et al. [15] proposed a group-based MFEA to group tasks of similar types and the genetic information can only be transferred within the same groups.”
BackgroundA Note on Usefulness of Geometrical Crossover for Numerical Optimization Problems.
Michalewicz, Z., Nazhiyath, G., & Michalewicz, M. (1996) · Evolutionary Programming · Cited by 81
Multiple Exponential Recombination for Differential Evolution
Qiu, X., Tan, K. C., & Xu, J. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2536167 · Cited by 73 · cited 1×
“In the literature, for different optimization problems, many crossover operators with various search capabilities have been proposed [17]–[20].”
BackgroundSelf-citationLandscape synergy in evolutionary multitasking
Gupta, A., Ong, Y.-S., Da, B., Feng, L., & Handoko, S. D. (2016) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2016.7744178 · Cited by 60 · cited 1×
“…the multitask optimization process, MFO has demonstrated to outperform its single-task counterpart in terms of both convergence speed and solution quality on a set of optimization problems, including continuous, discrete, and the mixture of continuous and discrete optimization problems [3]–[7].”
BackgroundSelf-citationNew Variations of Order Crossover for Travelling Salesman Problem
Deep, K., & Mebrahtu, H. (2011) · Redalyc (Universidad Autónoma del Estado de México) · Cited by 54
Gupta, A., & Ong, Y.-S. (2016) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci.2016.7850038 · Cited by 46
The Boon of Gene-Culture Interaction for Effective Evolutionary Multitasking
Da, B., Gupta, A., Ong, Y.-S., & Feng, L. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-28270-1_5 · Cited by 13
Self-citationA probabilistic functional crossover operator for genetic programming
Bongard, J. (2010) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1830483.1830649 · Cited by 11
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
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.