Journal article · 2019 · Open access
A Multiple Surrogate Assisted Decomposition-Based Evolutionary Algorithm for Expensive Multi/Many-Objective Optimization
IEEE Transactions on Evolutionary Computation, 23(6), 1000–1014 · Published 12 February 2019 · DOI 10.1109/tevc.2019.2899030
In brief
“A Multiple Surrogate Assisted Decomposition-Based Evolutionary Algorithm for Expensive Multi/Many-Objective Optimization” is a 2019 journal article by Ahsanul Habib and 4 co-authors, published in IEEE Transactions on Evolutionary Computation. OpenAlex counts 168 citations as of 19 November 2026, which puts it in the top 1% of works published in 2019 by citations. It is open access: the full text is free to read at Jyväskylä University Digital Archive (University of Jyväskylä).
- Citations
- 168
- Most cited in
- 2024 (37)
- Field-weighted impact
- 14.51
- References
- 90
- Authors
- 5
Abstract
Many-objective optimization problems (MaOPs) contain four or more conflicting objectives to be optimized. A number of efficient decomposition-based evolutionary algorithms have been developed in the recent years to solve them. However, computationally expensive MaOPs have been scarcely investigated. Typically, surrogate-assisted methods have been used in the literature to tackle computationally expensive problems, but such studies have largely focused on problems with 1-3 objectives. In this paper, we present an approach called hybrid surrogate-assisted many-objective evolutionary algorithm to solve computationally expensive MaOPs. The key features of the approach include: 1) the use of multiple surrogates to effectively approximate a wide range of objective functions; 2) use of two sets of reference vectors for improved performance on irregular Pareto fronts (PFs); 3) effective use of archive solutions during offspring generation; and 4) a local improvement scheme for generating high quality infill solutions. Furthermore, the approach includes constraint handling which is often overlooked in contemporary algorithms. The performance of the approach is benchmarked extensively on a set of unconstrained and constrained problems with regular and irregular PFs. A statistical comparison with the existing techniques highlights the efficacy and potential of the approach.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Habib, A., Singh, H. K., Chugh, T., Ray, T., & Miettinen, K. (2019). A Multiple Surrogate Assisted Decomposition-Based Evolutionary Algorithm for Expensive Multi/Many-Objective Optimization. IEEE Transactions on Evolutionary Computation, 23(6), 1000–1014. https://doi.org/10.1109/tevc.2019.2899030
MLA 9
Habib, Ahsanul, et al. “A Multiple Surrogate Assisted Decomposition-Based Evolutionary Algorithm for Expensive Multi/Many-Objective Optimization.” IEEE Transactions on Evolutionary Computation, vol. 23, no. 6, 2019, pp. 1000–1014. https://doi.org/10.1109/tevc.2019.2899030.
Chicago
Habib, Ahsanul, Hemant Kumar Singh, Tinkle Chugh, Tapabrata Ray, and Kaisa Miettinen. 2019. “A Multiple Surrogate Assisted Decomposition-Based Evolutionary Algorithm for Expensive Multi/Many-Objective Optimization.” IEEE Transactions on Evolutionary Computation 23 (6): 1000–1014. https://doi.org/10.1109/tevc.2019.2899030.
Harvard
Habib, A. et al. (2019) ‘A Multiple Surrogate Assisted Decomposition-Based Evolutionary Algorithm for Expensive Multi/Many-Objective Optimization’, IEEE Transactions on Evolutionary Computation, 23(6), pp. 1000–1014. doi:10.1109/tevc.2019.2899030.
IEEE
A. Habib, H. K. Singh, T. Chugh, T. Ray, and K. Miettinen, “A Multiple Surrogate Assisted Decomposition-Based Evolutionary Algorithm for Expensive Multi/Many-Objective Optimization,” IEEE Transactions on Evolutionary Computation, vol. 23, no. 6, pp. 1000–1014, 2019, doi: 10.1109/tevc.2019.2899030.
BibTeX
@article{habib2019multiple,
title = {{A Multiple Surrogate Assisted Decomposition-Based Evolutionary Algorithm for Expensive Multi/Many-Objective Optimization}},
author = {Habib, Ahsanul and Singh, Hemant Kumar and Chugh, Tinkle and Ray, Tapabrata and Miettinen, Kaisa},
journal = {IEEE Transactions on Evolutionary Computation},
year = {2019},
volume = {23},
number = {6},
pages = {1000--1014},
doi = {10.1109/tevc.2019.2899030},
url = {https://doi.org/10.1109/tevc.2019.2899030}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2020 | 17 | |
| 2021 | 27 | |
| 2022 | 24 | |
| 2023 | 29 | |
| 2024 | 37 | |
| 2025 | 22 | |
| 2026 | 12 |
Its field-weighted citation impact is 14.51: it has been cited 14.51 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
- many-objective optimization
- expensive optimization
- surrogate-assisted evolutionary algorithms
- decomposition-based evolutionary algorithms
- reference vectors
- local improvement
- infill sampling
- constraint handling
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?
Habib, A., Singh, H. K., Chugh, T., Ray, T., & Miettinen, K. (2019). A Multiple Surrogate Assisted Decomposition-Based Evolutionary Algorithm for Expensive Multi/Many-Objective Optimization. IEEE Transactions on Evolutionary Computation, 23(6), 1000–1014. https://doi.org/10.1109/tevc.2019.2899030
How many times has this paper been cited?
168 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 Jyväskylä University Digital Archive (University of Jyväskylä): sign in and open the PDF from this page.
Who wrote this paper?
Ahsanul Habib, Hemant Kumar Singh, Tinkle Chugh, Tapabrata Ray, Kaisa Miettinen.
What is the DOI of this paper?
10.1109/tevc.2019.2899030, permanently at https://doi.org/10.1109/tevc.2019.2899030. 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.