Conference paper · 2017 · Open access
Alternative infill strategies for expensive multi-objective optimisation
Genetic and Evolutionary Computation Conference (GECCO), 873–880 · Published 30 June 2017 · DOI 10.1145/3071178.3071276
In brief
“Alternative infill strategies for expensive multi-objective optimisation” is a 2017 conference paper by Alma Rahat and 2 co-authors, published in Genetic and Evolutionary Computation Conference (GECCO). OpenAlex counts 69 citations as of 19 November 2026. It is open access: the full text is free to read at PEARL (University of Plymouth).
- Citations
- 69
- Most cited in
- 2022 (16)
- Field-weighted impact
- 2.45
- References
- 33
- Authors
- 3
Abstract
Many multi-objective optimisation problems incorporate computationally or financially expensive objective functions. State-of-the-art algorithms therefore construct surrogate model(s) of the parameter space to objective functions mapping to guide the choice of the next solution to expensively evaluate. Starting from an initial set of solutions, an infill criterion - a surrogate-based indicator of quality - is extremised to determine which solution to evaluate next, until the budget of expensive evaluations is exhausted. Many successful infill criteria are dependent on multi-dimensional integration, which may result in infill criteria that are themselves impractically expensive. We propose a computationally cheap infill criterion based on the minimum probability of improvement over the estimated Pareto set. We also present a range of set-based scalarisation methods modelling hypervolume contribution, dominance ratio and distance measures. These permit the use of straightforward expected improvement as a cheap infill criterion. We investigated the performance of these novel strategies on standard multi-objective test problems, and compared them with the popular SMS-EGO and ParEGO methods. Unsurprisingly, our experiments show that the best strategy is problem dependent, but in many cases a cheaper strategy is at least as good as more expensive alternatives.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Rahat, A., Everson, R., & Fieldsend, J. E. (2017). Alternative infill strategies for expensive multi-objective optimisation. Genetic and Evolutionary Computation Conference (GECCO), 873–880. https://doi.org/10.1145/3071178.3071276
MLA 9
Rahat, Alma, et al. “Alternative infill strategies for expensive multi-objective optimisation.” Genetic and Evolutionary Computation Conference (GECCO), 2017, pp. 873–880. https://doi.org/10.1145/3071178.3071276.
Chicago
Rahat, Alma, Richard Everson, and Jonathan Edward Fieldsend. 2017. “Alternative infill strategies for expensive multi-objective optimisation.” Genetic and Evolutionary Computation Conference (GECCO): 873–880. https://doi.org/10.1145/3071178.3071276.
Harvard
Rahat, A., Everson, R. and Fieldsend, J. E. (2017) ‘Alternative infill strategies for expensive multi-objective optimisation’, Genetic and Evolutionary Computation Conference (GECCO), pp. 873–880. doi:10.1145/3071178.3071276.
IEEE
A. Rahat, R. Everson, and J. E. Fieldsend, “Alternative infill strategies for expensive multi-objective optimisation,” Genetic and Evolutionary Computation Conference (GECCO), pp. 873–880, 2017, doi: 10.1145/3071178.3071276.
BibTeX
@inproceedings{rahat2017alternative,
title = {{Alternative infill strategies for expensive multi-objective optimisation}},
author = {Rahat, Alma and Everson, Richard and Fieldsend, Jonathan Edward},
booktitle = {Genetic and Evolutionary Computation Conference (GECCO)},
year = {2017},
pages = {873--880},
doi = {10.1145/3071178.3071276},
url = {https://doi.org/10.1145/3071178.3071276}
}
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 | 1 | |
| 2018 | 4 | |
| 2019 | 2 | |
| 2020 | 5 | |
| 2021 | 8 | |
| 2022 | 16 | |
| 2023 | 7 | |
| 2024 | 14 | |
| 2025 | 8 | |
| 2026 | 4 |
Its field-weighted citation impact is 2.45: it has been cited 2.45 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
- expected improvement
- surrogate models
- Pareto set
- dominance ratio
- distance measures
- expensive function evaluations
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?
Rahat, A., Everson, R., & Fieldsend, J. E. (2017). Alternative infill strategies for expensive multi-objective optimisation. Genetic and Evolutionary Computation Conference (GECCO), 873–880. https://doi.org/10.1145/3071178.3071276
How many times has this paper been cited?
69 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 PEARL (University of Plymouth): sign in and open the PDF from this page.
Who wrote this paper?
Alma Rahat, Richard Everson, Jonathan Edward Fieldsend.
What is the DOI of this paper?
10.1145/3071178.3071276, permanently at https://doi.org/10.1145/3071178.3071276. 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.