Journal article · 2024 · Open access
Surrogate-assisted evolutionary algorithms for expensive combinatorial optimization: a survey
Complex & Intelligent Systems, 10(4), 5933–5949 · Published 18 May 2024 · DOI 10.1007/s40747-024-01465-5
In brief
“Surrogate-assisted evolutionary algorithms for expensive combinatorial optimization: a survey” is a 2024 journal article by Shulei Liu and 3 co-authors, published in Complex & Intelligent Systems. OpenAlex counts 93 citations as of 19 November 2026, which puts it in the top 5% of works published in 2024 by citations. It is open access under a CC BY licence: the full text is free to read at Complex & Intelligent Systems.
- Citations
- 93
- Most cited in
- 2026 (66)
- Field-weighted impact
- 8.42
- References
- 125
- Authors
- 4
Abstract
As potent approaches for addressing computationally expensive optimization problems, surrogate-assisted evolutionary algorithms (SAEAs) have garnered increasing attention. Prevailing endeavors in evolutionary computation predominantly concentrate on expensive continuous optimization problems, with a notable scarcity of investigations directed toward expensive combinatorial optimization problems (ECOPs). Nevertheless, numerous ECOPs persist in practical applications. The widespread prevalence of such problems starkly contrasts the limited development of relevant research. Motivated by this disparity, this paper conducts a comprehensive survey on SAEAs tailored to address ECOPs. This survey comprises two primary segments. The first segment synthesizes prevalent global, local, hybrid, and learning search strategies, elucidating their respective strengths and weaknesses. Subsequently, the second segment furnishes an overview of surrogate-based evaluation technologies, delving into three pivotal facets: model selection, construction, and management. The paper also discusses several potential future directions for SAEAs with a focus towards expensive combinatorial optimization.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Liu, S., Wang, H., Peng, W., & Yao, W. (2024). Surrogate-assisted evolutionary algorithms for expensive combinatorial optimization: a survey. Complex & Intelligent Systems, 10(4), 5933–5949. https://doi.org/10.1007/s40747-024-01465-5
MLA 9
Liu, Shulei, et al. “Surrogate-assisted evolutionary algorithms for expensive combinatorial optimization: a survey.” Complex & Intelligent Systems, vol. 10, no. 4, 2024, pp. 5933–5949. https://doi.org/10.1007/s40747-024-01465-5.
Chicago
Liu, Shulei, Handing Wang, Wei Peng, and Wen Yao. 2024. “Surrogate-assisted evolutionary algorithms for expensive combinatorial optimization: a survey.” Complex & Intelligent Systems 10 (4): 5933–5949. https://doi.org/10.1007/s40747-024-01465-5.
Harvard
Liu, S. et al. (2024) ‘Surrogate-assisted evolutionary algorithms for expensive combinatorial optimization: a survey’, Complex & Intelligent Systems, 10(4), pp. 5933–5949. doi:10.1007/s40747-024-01465-5.
IEEE
S. Liu, H. Wang, W. Peng, and W. Yao, “Surrogate-assisted evolutionary algorithms for expensive combinatorial optimization: a survey,” Complex & Intelligent Systems, vol. 10, no. 4, pp. 5933–5949, 2024, doi: 10.1007/s40747-024-01465-5.
BibTeX
@article{liu2024surrogate,
title = {{Surrogate-assisted evolutionary algorithms for expensive combinatorial optimization: a survey}},
author = {Liu, Shulei and Wang, Handing and Peng, Wei and Yao, Wen},
journal = {Complex \& Intelligent Systems},
year = {2024},
volume = {10},
number = {4},
pages = {5933--5949},
doi = {10.1007/s40747-024-01465-5},
url = {https://doi.org/10.1007/s40747-024-01465-5}
}
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 | 4 | |
| 2025 | 23 | |
| 2026 | 66 |
Its field-weighted citation impact is 8.42: it has been cited 8.42 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
- surrogate models
- surrogate model selection
- hybrid evolutionary algorithm
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?
Liu, S., Wang, H., Peng, W., & Yao, W. (2024). Surrogate-assisted evolutionary algorithms for expensive combinatorial optimization: a survey. Complex & Intelligent Systems, 10(4), 5933–5949. https://doi.org/10.1007/s40747-024-01465-5
How many times has this paper been cited?
93 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 Complex & Intelligent Systems: sign in and open the full text from this page.
Who wrote this paper?
Shulei Liu, Handing Wang, Wei Peng, Wen Yao.
What is the DOI of this paper?
10.1007/s40747-024-01465-5, permanently at https://doi.org/10.1007/s40747-024-01465-5. 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.