Journal article · 2023
A Surrogate-Assisted Evolutionary Algorithm for Seeking Multiple Solutions of Expensive Multimodal Optimization Problems
IEEE Transactions on Emerging Topics in Computational Intelligence, 8(1), 377–388 · Published 15 August 2023 · DOI 10.1109/tetci.2023.3301794
In brief
“A Surrogate-Assisted Evolutionary Algorithm for Seeking Multiple Solutions of Expensive Multimodal Optimization Problems” is a 2023 journal article by Jing–Yu Ji and 4 co-authors, published in IEEE Transactions on Emerging Topics in Computational Intelligence. OpenAlex counts 49 citations as of 19 November 2026, which puts it in the top 1% of works published in 2023 by citations. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 49
- Most cited in
- 2025 (24)
- Field-weighted impact
- 2.75
- References
- 61
- Authors
- 5
Abstract
Surrogate-assisted evolutionary algorithms for expensive optimization problems have gained considerable attention in recent years. In many real-world optimization problems, we may face expensive optimization problems with multiple optimal solutions. Locating multiple optima for such expensive problems is qualitatively challenging. This study proposes a surrogate-assisted differential evolution based on region decomposition to seek multiple optima for… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Ji, J., Tan, Z., Zeng, S., See-To, E. W., & Wong, M. (2023). A Surrogate-Assisted Evolutionary Algorithm for Seeking Multiple Solutions of Expensive Multimodal Optimization Problems. IEEE Transactions on Emerging Topics in Computational Intelligence, 8(1), 377–388. https://doi.org/10.1109/tetci.2023.3301794
MLA 9
Ji, Jing–Yu, et al. “A Surrogate-Assisted Evolutionary Algorithm for Seeking Multiple Solutions of Expensive Multimodal Optimization Problems.” IEEE Transactions on Emerging Topics in Computational Intelligence, vol. 8, no. 1, 2023, pp. 377–388. https://doi.org/10.1109/tetci.2023.3301794.
Chicago
Ji, Jing–Yu, Zusheng Tan, Sanyou Zeng, Eric W.K. See-To, and Man–Leung Wong. 2023. “A Surrogate-Assisted Evolutionary Algorithm for Seeking Multiple Solutions of Expensive Multimodal Optimization Problems.” IEEE Transactions on Emerging Topics in Computational Intelligence 8 (1): 377–388. https://doi.org/10.1109/tetci.2023.3301794.
Harvard
Ji, J. et al. (2023) ‘A Surrogate-Assisted Evolutionary Algorithm for Seeking Multiple Solutions of Expensive Multimodal Optimization Problems’, IEEE Transactions on Emerging Topics in Computational Intelligence, 8(1), pp. 377–388. doi:10.1109/tetci.2023.3301794.
IEEE
J. Ji, Z. Tan, S. Zeng, E. W. See-To, and M. Wong, “A Surrogate-Assisted Evolutionary Algorithm for Seeking Multiple Solutions of Expensive Multimodal Optimization Problems,” IEEE Transactions on Emerging Topics in Computational Intelligence, vol. 8, no. 1, pp. 377–388, 2023, doi: 10.1109/tetci.2023.3301794.
BibTeX
@article{ji2023surrogate,
title = {{A Surrogate-Assisted Evolutionary Algorithm for Seeking Multiple Solutions of Expensive Multimodal Optimization Problems}},
author = {Ji, Jing–Yu and Tan, Zusheng and Zeng, Sanyou and See-To, Eric W.K. and Wong, Man–Leung},
journal = {IEEE Transactions on Emerging Topics in Computational Intelligence},
year = {2023},
volume = {8},
number = {1},
pages = {377--388},
doi = {10.1109/tetci.2023.3301794},
url = {https://doi.org/10.1109/tetci.2023.3301794}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2024 | 12 | |
| 2025 | 24 | |
| 2026 | 13 |
Its field-weighted citation impact is 2.75: it has been cited 2.75 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 › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- surrogate-assisted evolutionary algorithms
- expensive optimization
- multimodal optimization
- multiple optima
- differential evolution
- local search
- subpopulations
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Ji, J., Tan, Z., Zeng, S., See-To, E. W., & Wong, M. (2023). A Surrogate-Assisted Evolutionary Algorithm for Seeking Multiple Solutions of Expensive Multimodal Optimization Problems. IEEE Transactions on Emerging Topics in Computational Intelligence, 8(1), 377–388. https://doi.org/10.1109/tetci.2023.3301794
How many times has this paper been cited?
49 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?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Jing–Yu Ji, Zusheng Tan, Sanyou Zeng, Eric W.K. See-To, Man–Leung Wong.
What is the DOI of this paper?
10.1109/tetci.2023.3301794, permanently at https://doi.org/10.1109/tetci.2023.3301794. 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.