Conference paper · 2014 · Open access
A constrained multi-objective surrogate-based optimization algorithm
IEEE Congress on Evolutionary Computation (CEC), 3080–3087 · Published 1 July 2014 · DOI 10.1109/cec.2014.6900581
In brief
“A constrained multi-objective surrogate-based optimization algorithm” is a 2014 conference paper by Prashant Singh and 3 co-authors, published in IEEE Congress on Evolutionary Computation (CEC). OpenAlex counts 44 citations as of 19 November 2026. It is open access: the full text is free to read at Ghent University Academic Bibliography (Ghent University).
- Citations
- 44
- Most cited in
- 2024 (7)
- Field-weighted impact
- 2.14
- References
- 17
- Authors
- 4
Abstract
Surrogate models or metamodels are widely used in the realm of engineering for design optimization to minimize the number of computationally expensive simulations. Most practical problems often have conflicting objectives, which lead to a number of competing solutions which form a Pareto front. Multi-objective surrogate-based constrained optimization algorithms have been proposed in literature, but handling constraints directly is a relatively new research area. Most algorithms proposed to directly deal with multi-objective optimization have been evolutionary algorithms (Multi-Objective Evolutionary Algorithms - MOEAs). MOEAs can handle large design spaces but require a large number of simulations, which might be infeasible in practice, especially if the constraints are expensive. A multi-objective constrained optimization algorithm is presented in this paper which makes use of Kriging models, in conjunction with multi-objective probability of improvement (PoI) and probability of feasibility (PoF) criteria to drive the sample selection process economically. The efficacy of the proposed algorithm is demonstrated on an analytical benchmark function, and the algorithm is then used to solve a microwave filter design optimization problem.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Singh, P., Couckuyt, I., Ferranti, F., & Dhaene, T. (2014). A constrained multi-objective surrogate-based optimization algorithm. IEEE Congress on Evolutionary Computation (CEC), 3080–3087. https://doi.org/10.1109/cec.2014.6900581
MLA 9
Singh, Prashant, et al. “A constrained multi-objective surrogate-based optimization algorithm.” IEEE Congress on Evolutionary Computation (CEC), 2014, pp. 3080–3087. https://doi.org/10.1109/cec.2014.6900581.
Chicago
Singh, Prashant, Ivo Couckuyt, Francesco Ferranti, and Tom Dhaene. 2014. “A constrained multi-objective surrogate-based optimization algorithm.” IEEE Congress on Evolutionary Computation (CEC): 3080–3087. https://doi.org/10.1109/cec.2014.6900581.
Harvard
Singh, P. et al. (2014) ‘A constrained multi-objective surrogate-based optimization algorithm’, IEEE Congress on Evolutionary Computation (CEC), pp. 3080–3087. doi:10.1109/cec.2014.6900581.
IEEE
P. Singh, I. Couckuyt, F. Ferranti, and T. Dhaene, “A constrained multi-objective surrogate-based optimization algorithm,” IEEE Congress on Evolutionary Computation (CEC), pp. 3080–3087, 2014, doi: 10.1109/cec.2014.6900581.
BibTeX
@inproceedings{singh2014constrained,
title = {{A constrained multi-objective surrogate-based optimization algorithm}},
author = {Singh, Prashant and Couckuyt, Ivo and Ferranti, Francesco and Dhaene, Tom},
booktitle = {IEEE Congress on Evolutionary Computation (CEC)},
year = {2014},
pages = {3080--3087},
doi = {10.1109/cec.2014.6900581},
url = {https://doi.org/10.1109/cec.2014.6900581}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 5 | |
| 2018 | 3 | |
| 2019 | 4 | |
| 2020 | 2 | |
| 2021 | 5 | |
| 2022 | 4 | |
| 2023 | 6 | |
| 2024 | 7 | |
| 2025 | 1 | |
| 2026 | 1 |
Its field-weighted citation impact is 2.14: it has been cited 2.14 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
- multi-objective optimization
- constrained optimization
- surrogate-based optimization
- Kriging model
- meta-model
- probability of improvement
- Pareto front
- sample selection
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?
Singh, P., Couckuyt, I., Ferranti, F., & Dhaene, T. (2014). A constrained multi-objective surrogate-based optimization algorithm. IEEE Congress on Evolutionary Computation (CEC), 3080–3087. https://doi.org/10.1109/cec.2014.6900581
How many times has this paper been cited?
44 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 Ghent University Academic Bibliography (Ghent University): sign in and open the PDF from this page.
Who wrote this paper?
Prashant Singh, Ivo Couckuyt, Francesco Ferranti, Tom Dhaene.
What is the DOI of this paper?
10.1109/cec.2014.6900581, permanently at https://doi.org/10.1109/cec.2014.6900581. 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.