Evolutionary Multitasking With Dynamic Resource Allocating Strategy
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Evolutionary multitasking is a recently proposed paradigm to simultaneously solve multiple tasks using a single population. Most of the existing evolutionary multitasking algorithms treat all tasks equally and then assign the same amount of resources to each task. However, when the resources are limited, it is difficult for some tasks to converge to acceptable solutions. This paper aims at investigating the resource allocation in the multitasking environment to efficiently utilize the restrictive resources. In this paper, we design a novel multitask evolutionary algorithm with an online dynamic resource allocation strategy. Specifically, the proposed dynamic resource allocation strategy allocates resources to each task adaptively according to the requirements of tasks. We also design an adaptive method to control the resources invested into cross-domain searching. The proposed algorithm is able to allocate the computational resources dynamically according to the computational complexities of tasks. The experimental results demonstrate the superiority of the proposed method in comparison with the state-of-the-art algorithms on benchmark problems of multitask optimization.
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
Pan, S. J., & Yang, Q. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.191 · Cited by 23,387
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069 · cited 7×
“MFEA has already been used to solve single-objective optimization [8] and multiobjective optimization (MOO) tasks [9] and achieved some impressive results [10]–[13].”
BackgroundInfluentialSelf-citationDifferential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
Caruana, R. (1998) · Learning to Learn · doi:10.1007/978-1-4615-5529-2_5 · Cited by 577
Cited by
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
Toward Adaptive Knowledge Transfer in Multifactorial Evolutionary Computation
Zhou, L., Feng, L., Tan, K. C., Zhong, J., Zhu, Z., Liu, K., & Chen, C. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2974100 · Cited by 249
“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.”
Background
Metadata
- Authors
- Gong, M., Tang, Z., Li, H., & Zhang, J.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2019-10
- Volume
- 23
- Issue
- 5
- Pages
- 858-869
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2910556840
- Cited by
- 177
- References
- 4
- FWCI
- 10.71
- 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: Evolutionary Multitasking With Dynamic Resource Allocating Strategy. https://app.cochat.ai/papers/10.1109/tevc.2019.2893614
- The paper
- Gong, M., Tang, Z., Li, H., & Zhang, J. (2019). Evolutionary Multitasking With Dynamic Resource Allocating Strategy. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2019.2893614
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.