Journal article · 2016 · Open access

A Surrogate-Assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-Objective Optimization

Tinkle Chugh, Yaochu Jin, Kaisa Miettinen, Jussi Hakanen, Karthik Sindhya

IEEE Transactions on Evolutionary Computation, 22(1), 129–142 · Published 27 October 2016 · DOI 10.1109/tevc.2016.2622301

Open PDFView at the publisherCite this paper

In brief

“A Surrogate-Assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-Objective Optimization” is a 2016 journal article by Tinkle Chugh and 4 co-authors, published in IEEE Transactions on Evolutionary Computation. OpenAlex counts 658 citations as of 19 November 2026. It is open access: the full text is free to read at Jyväskylä University Digital Archive (University of Jyväskylä).

Citations
658
Most cited in
2024 (107)
Field-weighted impact
24.54
References
59
Authors
5

Abstract

We propose a surrogate-assisted reference vector guided evolutionary algorithm (EA) for computationally expensive optimization problems with more than three objectives. The proposed algorithm is based on a recently developed EA for many-objective optimization that relies on a set of adaptive reference vectors for selection. The proposed surrogate-assisted EA (SAEA) uses Kriging to approximate each objective function to reduce the computational cost. In managing the Kriging models, the algorithm focuses on the balance of diversity and convergence by making use of the uncertainty information in the approximated objective values given by the Kriging models, the distribution of the reference vectors as well as the location of the individuals. In addition, we design a strategy for choosing data for training the Kriging model to limit the computation time without impairing the approximation accuracy. Empirical results on comparing the new algorithm with the state-of-the-art SAEAs on a number of benchmark problems demonstrate the competitiveness of the proposed algorithm.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Chugh, T., Jin, Y., Miettinen, K., Hakanen, J., & Sindhya, K. (2016). A Surrogate-Assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-Objective Optimization. IEEE Transactions on Evolutionary Computation, 22(1), 129–142. https://doi.org/10.1109/tevc.2016.2622301

MLA 9

Chugh, Tinkle, et al. “A Surrogate-Assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-Objective Optimization.” IEEE Transactions on Evolutionary Computation, vol. 22, no. 1, 2016, pp. 129–142. https://doi.org/10.1109/tevc.2016.2622301.

Chicago

Chugh, Tinkle, Yaochu Jin, Kaisa Miettinen, Jussi Hakanen, and Karthik Sindhya. 2016. “A Surrogate-Assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-Objective Optimization.” IEEE Transactions on Evolutionary Computation 22 (1): 129–142. https://doi.org/10.1109/tevc.2016.2622301.

Harvard

Chugh, T. et al. (2016) ‘A Surrogate-Assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-Objective Optimization’, IEEE Transactions on Evolutionary Computation, 22(1), pp. 129–142. doi:10.1109/tevc.2016.2622301.

IEEE

T. Chugh, Y. Jin, K. Miettinen, J. Hakanen, and K. Sindhya, “A Surrogate-Assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-Objective Optimization,” IEEE Transactions on Evolutionary Computation, vol. 22, no. 1, pp. 129–142, 2016, doi: 10.1109/tevc.2016.2622301.

BibTeX

@article{chugh2016surrogate,
  title     = {{A Surrogate-Assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-Objective Optimization}},
  author    = {Chugh, Tinkle and Jin, Yaochu and Miettinen, Kaisa and Hakanen, Jussi and Sindhya, Karthik},
  journal   = {IEEE Transactions on Evolutionary Computation},
  year      = {2016},
  volume    = {22},
  number    = {1},
  pages     = {129--142},
  doi       = {10.1109/tevc.2016.2622301},
  url       = {https://doi.org/10.1109/tevc.2016.2622301}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
20171414
20183434
20194141
20203939
20218282
20227474
2023100100
2024107107
20259090
20267676

Its field-weighted citation impact is 24.54: it has been cited 24.54 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

  • surrogate-assisted evolutionary algorithms
  • many-objective optimization
  • Kriging surrogate model
  • computationally expensive optimization
  • uncertainty information
  • training data selection

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Chugh, T., Jin, Y., Miettinen, K., Hakanen, J., & Sindhya, K. (2016). A Surrogate-Assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-Objective Optimization. IEEE Transactions on Evolutionary Computation, 22(1), 129–142. https://doi.org/10.1109/tevc.2016.2622301

How many times has this paper been cited?

658 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?

Tinkle Chugh, Yaochu Jin, Kaisa Miettinen, Jussi Hakanen, Karthik Sindhya.

What is the DOI of this paper?

10.1109/tevc.2016.2622301, permanently at https://doi.org/10.1109/tevc.2016.2622301. 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.