Journal article · 2024 · Open access

Evolutionary Optimization with a Simplified Helper Task for High-Dimensional Expensive Multiobjective Problems

Xunfeng Wu, Qiuzhen Lin, Junwei Zhou, Songbai Liu, Carlos A. Coello Coello, Victor C. M. Leung

ACM Transactions on Evolutionary Learning and Optimization, 4(4), 1–32 · Published 11 January 2024 · DOI 10.1145/3637065

Open PDFView at the publisherCite this paper

In brief

“Evolutionary Optimization with a Simplified Helper Task for High-Dimensional Expensive Multiobjective Problems” is a 2024 journal article by Xunfeng Wu and 5 co-authors, published in ACM Transactions on Evolutionary Learning and Optimization. OpenAlex counts 11 citations as of 19 November 2026, which puts it in the top 6% of works published in 2024 by citations. It is open access: the full text is free to read at ACM Transactions on Evolutionary Learning and Optimization.

Citations
11
Most cited in
2025 (4)
Field-weighted impact
2.27
References
71
Authors
6

Abstract

In recent years, surrogate-assisted evolutionary algorithms (SAEAs) have been sufficiently studied for tackling computationally expensive multiobjective optimization problems (EMOPs), as they can quickly estimate the qualities of solutions by using surrogate models to substitute for expensive evaluations. However, most existing SAEAs only show promising performance for solving EMOPs with no more than 10 dimensions, and become less efficient for tackling EMOPs with higher dimensionality. Thus, this article proposes a new SAEA with a simplified helper task for tackling high-dimensional EMOPs. In each generation, one simplified task will be generated artificially by using random dimension reduction on the target task (i.e., the target EMOPs). Then, two surrogate models are trained for the helper task and the target task, respectively. Based on the trained surrogate models, evolutionary multitasking optimization is run to solve these two tasks so that the experiences of solving the helper task can be transferred to speed up the convergence of tackling the target task. Moreover, an effective model management strategy is designed to select new promising samples for training the surrogate models. When compared to five competitive SAEAs on four well-known benchmark suites, the experiments validate the advantages of the proposed algorithm on most test cases.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Wu, X., Lin, Q., Zhou, J., Liu, S., Coello, C. A. C., & Leung, V. C. M. (2024). Evolutionary Optimization with a Simplified Helper Task for High-Dimensional Expensive Multiobjective Problems. ACM Transactions on Evolutionary Learning and Optimization, 4(4), 1–32. https://doi.org/10.1145/3637065

MLA 9

Wu, Xunfeng, et al. “Evolutionary Optimization with a Simplified Helper Task for High-Dimensional Expensive Multiobjective Problems.” ACM Transactions on Evolutionary Learning and Optimization, vol. 4, no. 4, 2024, pp. 1–32. https://doi.org/10.1145/3637065.

Chicago

Wu, Xunfeng, Qiuzhen Lin, Junwei Zhou, Songbai Liu, Carlos A. Coello Coello, and Victor C. M. Leung. 2024. “Evolutionary Optimization with a Simplified Helper Task for High-Dimensional Expensive Multiobjective Problems.” ACM Transactions on Evolutionary Learning and Optimization 4 (4): 1–32. https://doi.org/10.1145/3637065.

Harvard

Wu, X. et al. (2024) ‘Evolutionary Optimization with a Simplified Helper Task for High-Dimensional Expensive Multiobjective Problems’, ACM Transactions on Evolutionary Learning and Optimization, 4(4), pp. 1–32. doi:10.1145/3637065.

IEEE

X. Wu, Q. Lin, J. Zhou, S. Liu, C. A. C. Coello, and V. C. M. Leung, “Evolutionary Optimization with a Simplified Helper Task for High-Dimensional Expensive Multiobjective Problems,” ACM Transactions on Evolutionary Learning and Optimization, vol. 4, no. 4, pp. 1–32, 2024, doi: 10.1145/3637065.

BibTeX

@article{wu2024evolutionary,
  title     = {{Evolutionary Optimization with a Simplified Helper Task for High-Dimensional Expensive Multiobjective Problems}},
  author    = {Wu, Xunfeng and Lin, Qiuzhen and Zhou, Junwei and Liu, Songbai and Coello, Carlos A. Coello and Leung, Victor C. M.},
  journal   = {ACM Transactions on Evolutionary Learning and Optimization},
  year      = {2024},
  volume    = {4},
  number    = {4},
  pages     = {1--32},
  doi       = {10.1145/3637065},
  url       = {https://doi.org/10.1145/3637065}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202433
202544
202644

Its field-weighted citation impact is 2.27: it has been cited 2.27 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms

  • surrogate-assisted evolutionary algorithms
  • high-dimensional optimization
  • evolutionary multitasking
  • dimensionality reduction
  • expensive function evaluations

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Wu, X., Lin, Q., Zhou, J., Liu, S., Coello, C. A. C., & Leung, V. C. M. (2024). Evolutionary Optimization with a Simplified Helper Task for High-Dimensional Expensive Multiobjective Problems. ACM Transactions on Evolutionary Learning and Optimization, 4(4), 1–32. https://doi.org/10.1145/3637065

How many times has this paper been cited?

11 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at ACM Transactions on Evolutionary Learning and Optimization: sign in and open the PDF from this page.

Who wrote this paper?

Xunfeng Wu, Qiuzhen Lin, Junwei Zhou, Songbai Liu, Carlos A. Coello Coello, Victor C. M. Leung.

What is the DOI of this paper?

10.1145/3637065, permanently at https://doi.org/10.1145/3637065. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.