Journal article · 2022 · Open access
Objective-Constraint Mutual-Guided Surrogate-Based Particle Swarm Optimization for Expensive Constrained Multimodal Problems
IEEE Transactions on Evolutionary Computation, 27(4), 908–922 · Published 14 June 2022 · DOI 10.1109/tevc.2022.3182810
In brief
“Objective-Constraint Mutual-Guided Surrogate-Based Particle Swarm Optimization for Expensive Constrained Multimodal Problems” is a 2022 journal article by Zhang Yon and 4 co-authors, published in IEEE Transactions on Evolutionary Computation. OpenAlex counts 32 citations as of 19 November 2026. It is open access: the full text is free to read at UEF eRepo (University of Eastern Finland).
- Citations
- 32
- Most cited in
- 2025 (19)
- Field-weighted impact
- 4.15
- References
- 51
- Authors
- 5
Abstract
Expensive constraint multimodal optimization problems (ECMMOPs) have such characteristics as expensive objectives and constraints, and multiple optimal modalities simultaneously, which pose severe challenges to evolutionary optimization methods. This article studies an objective-constraint mutual-guided surrogate-assisted particle swarm optimization algorithm for the kind of problem, aiming to discover multiple competing feasible optimal solutions at a lower calculation cost. The algorithm designs first a new two-layer cooperative surrogate model framework based on heterogeneous database to effectively adjust the prediction accuracies of objective surrogates and constraint surrogates on different search regions. An objective-constraint mutual-guided partial evaluation strategy (O-C-PES) is developed to generate high-quality infilling samples for objective and constraint surrogates, respectively, based on which the number of unnecessary real evaluations can be significantly reduced. Moreover, a position feature-guided hybrid update mechanism (PF-HUM) is proposed to find more optimal solutions by searching excellent infeasible and feasible areas at the same time, and a feasible ratio-driven local search (FR-LS) strategy is proposed to improve the algorithm’s exploitation. Compared with four existing surrogate-assisted evolutionary algorithms (EAs) and one constraint multimodal EAs on 21 benchmark problems and three engineering instances, experiment results show that the proposed algorithm can simultaneously obtain multiple highly-competitive feasible optimal solutions with less computational cost.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Yon, Z., Ji, X., Gao, X., Gong, D., & Sun, X. (2022). Objective-Constraint Mutual-Guided Surrogate-Based Particle Swarm Optimization for Expensive Constrained Multimodal Problems. IEEE Transactions on Evolutionary Computation, 27(4), 908–922. https://doi.org/10.1109/tevc.2022.3182810
MLA 9
Yon, Zhang, et al. “Objective-Constraint Mutual-Guided Surrogate-Based Particle Swarm Optimization for Expensive Constrained Multimodal Problems.” IEEE Transactions on Evolutionary Computation, vol. 27, no. 4, 2022, pp. 908–922. https://doi.org/10.1109/tevc.2022.3182810.
Chicago
Yon, Zhang, Xinfang Ji, Xiao‐Zhi Gao, Dunwei Gong, and Xiaoyan Sun. 2022. “Objective-Constraint Mutual-Guided Surrogate-Based Particle Swarm Optimization for Expensive Constrained Multimodal Problems.” IEEE Transactions on Evolutionary Computation 27 (4): 908–922. https://doi.org/10.1109/tevc.2022.3182810.
Harvard
Yon, Z. et al. (2022) ‘Objective-Constraint Mutual-Guided Surrogate-Based Particle Swarm Optimization for Expensive Constrained Multimodal Problems’, IEEE Transactions on Evolutionary Computation, 27(4), pp. 908–922. doi:10.1109/tevc.2022.3182810.
IEEE
Z. Yon, X. Ji, X. Gao, D. Gong, and X. Sun, “Objective-Constraint Mutual-Guided Surrogate-Based Particle Swarm Optimization for Expensive Constrained Multimodal Problems,” IEEE Transactions on Evolutionary Computation, vol. 27, no. 4, pp. 908–922, 2022, doi: 10.1109/tevc.2022.3182810.
BibTeX
@article{yon2022objective,
title = {{Objective-Constraint Mutual-Guided Surrogate-Based Particle Swarm Optimization for Expensive Constrained Multimodal Problems}},
author = {Yon, Zhang and Ji, Xinfang and Gao, Xiao‐Zhi and Gong, Dunwei and Sun, Xiaoyan},
journal = {IEEE Transactions on Evolutionary Computation},
year = {2022},
volume = {27},
number = {4},
pages = {908--922},
doi = {10.1109/tevc.2022.3182810},
url = {https://doi.org/10.1109/tevc.2022.3182810}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2021 | 1 | |
| 2022 | 1 | |
| 2023 | 4 | |
| 2024 | 3 | |
| 2025 | 19 | |
| 2026 | 4 |
Its field-weighted citation impact is 4.15: it has been cited 4.15 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
- infill sampling
- multiple optimal solutions
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?
Yon, Z., Ji, X., Gao, X., Gong, D., & Sun, X. (2022). Objective-Constraint Mutual-Guided Surrogate-Based Particle Swarm Optimization for Expensive Constrained Multimodal Problems. IEEE Transactions on Evolutionary Computation, 27(4), 908–922. https://doi.org/10.1109/tevc.2022.3182810
How many times has this paper been cited?
32 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 UEF eRepo (University of Eastern Finland): sign in and open the PDF from this page.
Who wrote this paper?
Zhang Yon, Xinfang Ji, Xiao‐Zhi Gao, Dunwei Gong, Xiaoyan Sun.
What is the DOI of this paper?
10.1109/tevc.2022.3182810, permanently at https://doi.org/10.1109/tevc.2022.3182810. 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.