The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Surrogate-assisted particle swarm optimization algorithm with Pareto active learning for expensive multi-objective optimization
Abstract
For multi-objective optimization problems, particle swarm optimization (PSO) algorithm generally needs a large number of fitness evaluations to obtain the Pareto optimal solutions. However, it will become substantially time-consuming when handling computationally expensive fitness functions. In order to save the computational cost, a surrogate-assisted PSO with Pareto active learning is proposed. In real physical space (the objective functions are computationally expensive), PSO is used as an optimizer, and its optimization results are used to construct the surrogate models. In virtual space, objective functions are replaced by the cheaper surrogate models, PSO is viewed as a sampler to produce the candidate solutions. To enhance the quality of candidate solutions, a hybrid mutation sampling method based on the simulated evolution is proposed, which combines the advantage of fast convergence of PSO and implements mutation to increase diversity. Furthermore, ε-Pareto active learning (ε-PAL) method is employed to pre-select candidate solutions to guide PSO in the real physical space. However, little work has considered the method of determining parameter ε. Therefore, a greedy search method is presented to determine the value of ε where the number of active sampling is employed as the evaluation criteria of classification cost. Experimental studies involving application on a number of benchmark test problems and parameter determination for multi-input multi-output least squares support vector machines (MLSSVM) are given, in which the results demonstrate promising performance of the proposed algorithm compared with other representative multi-objective particle swarm optimization (MOPSO) algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Practical Bayesian Optimization of Machine Learning Algorithms
Snoek, J., Larochelle, H., & Adams, R. P. (2012) · arXiv · doi:10.48550/arxiv.1206.2944 · Cited by 6,691
Cited by
Tang, J., Liu, G., & Pan, Q. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1004129 · Cited by 996
Recent Advances in Bayesian Optimization
Wang, X., Jin, Y., Schmitt, S., & Olhofer, M. (2023) · ACM Computing Surveys · doi:10.1145/3582078 · Cited by 477
AI-based modeling and data-driven evaluation for smart manufacturing processes
Ghahramani, M., Qiao, Y., Zhou, M. C., O'Hagan, A., & Sweeney, J. (2020) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2020.1003114 · Cited by 334
A review of surrogate-assisted evolutionary algorithms for expensive optimization problems
He, C., Zhang, Y., Gong, D., & Ji, X. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.119495 · Cited by 272
Nonlinear energy sink with limited vibration amplitude
Geng, X.-F., Ding, H., Mao, X.-Y., & Chen, L.-Q. (2021) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2021.107625 · Cited by 144
Metadata
- Authors
- Lv, Z., Wang, L., Han, Z., Zhao, J., & Wang, W.
- Venue
- IEEE/CAA Journal of Automatica Sinica
- Published
- 2019-05
- Volume
- 6
- Issue
- 3
- Pages
- 838-849
- ISSN
- 2329-9266 (ISSN-L)
- 2329-9274
- OpenAlex
- W2933150416
- Cited by
- 179
- References
- 1
- FWCI
- 14.08
- 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: Surrogate-assisted particle swarm optimization algorithm with Pareto active learning for expensive multi-objective optimization. https://app.cochat.ai/papers/10.1109/jas.2019.1911450
- The paper
- Lv, Z., Wang, L., Han, Z., Zhao, J., & Wang, W. (2019). Surrogate-assisted particle swarm optimization algorithm with Pareto active learning for expensive multi-objective optimization. IEEE/CAA Journal of Automatica Sinica. https://doi.org/10.1109/jas.2019.1911450
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.