The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Generalized Multitasking for Evolutionary Optimization of Expensive Problems
Abstract
Conventional evolutionary algorithms (EAs) are not well suited for solving expensive optimization problems due to the fact that they often require a large number of fitness evaluations to obtain acceptable solutions. To alleviate the difficulty, this paper presents a multitasking evolutionary optimization framework for solving computationally expensive problems. In the framework, knowledge is transferred from a number of computationally cheap optimization problems to help the solution of the expensive problem on the basis of the recently proposed multifactorial EA (MFEA), leading to a faster convergence of the expensive problem. However, existing MFEAs do not work well in solving multitasking problems whose optimums do not lie in the same location or when the dimensions of the decision space are not the same. To address the above issues, the existing MFEA is generalized by proposing two strategies, one for decision variable translation and the other for decision variable shuffling, to facilitate knowledge transfer between optimization problems having different locations of the optimums and different numbers of decision variables. To assess the effectiveness of the generalized MFEA (G-MFEA), empirical studies have been conducted on eight multitasking instances and eight test problems for expensive optimization. The experimental results demonstrate that the proposed G-MFEA works more efficiently for multitasking optimization and successfully accelerates the convergence of expensive optimization problems compared to single-task optimization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Bäck, T. (1996) · Oxford University Press eBooks · doi:10.1093/oso/9780195099713.001.0001 · Cited by 5,113
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Biogeography-Based Optimization
Simon, D. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.919004 · Cited by 4,305
Simulated Binary Crossover for Continuous Search Space.
Deb, K., & Agrawal, R. B. (1995) · Complex Systems · Cited by 2,976
Knowles, J. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.851274 · Cited by 1,254
A comprehensive survey of fitness approximation in evolutionary computation
Jin, Y. (2005) · Soft Computing · doi:10.1007/s00500-003-0328-5 · Cited by 1,229
Self-citationMultifactorial 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
Significance Testing of the Spearman Rank Correlation Coefficient
Zar, J. H. (1972) · Journal of the American Statistical Association · doi:10.1080/01621459.1972.10481251 · Cited by 689
A framework for evolutionary optimization with approximate fitness functions
Jin, Y., Olhofer, M., & Sendhoff, B. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.800884 · Cited by 662
Self-citationMeta-Lamarckian Learning in Memetic Algorithms
Ong, Y. S., & Keane, A. J. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.819944 · Cited by 657
Cited by
Data-Driven Evolutionary Optimization: An Overview and Case Studies
Jin, Y., Wang, H., Chugh, T., Guo, D., & Miettinen, K. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2869001 · Cited by 686
Self-citationMultifactorial 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
Evolutionary Transfer Optimization - A New Frontier in Evolutionary Computation Research
Tan, K. C., Feng, L., & Jiang, M. (2021) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2020.3039066 · Cited by 315
A review of surrogate-assisted evolutionary algorithms for expensive optimization problems
He, C., Zhang, Y., Gong, D., & Ji, X. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.119495 · Cited by 272
Offline Data-Driven Evolutionary Optimization Using Selective Surrogate Ensembles
Wang, H., Jin, Y., Sun, C., & Doherty, J. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2834881 · Cited by 262
Self-citation
Metadata
- Authors
- Ding, J., Yang, C., Jin, Y., & Chai, T.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2019-02
- Volume
- 23
- Issue
- 1
- Pages
- 44-58
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2776317535
- Cited by
- 277
- References
- 33
- FWCI
- 10.00
- 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: Generalized Multitasking for Evolutionary Optimization of Expensive Problems. https://app.cochat.ai/papers/10.1109/tevc.2017.2785351
- The paper
- Ding, J., Yang, C., Jin, Y., & Chai, T. (2019). Generalized Multitasking for Evolutionary Optimization of Expensive Problems. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2017.2785351
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.