Abstract
© 2017 ACM. 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 inill 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.
DOI
10.1145/3071178.3071276
Publication Date
2017-07-01
Publication Title
GECCO 2017 - Proceedings of the 2017 Genetic and Evolutionary Computation Conference
Publisher
ACM
ISBN
9781450349208
Embargo Period
2024-11-22
First Page
873
Last Page
880
Recommended Citation
Rahat, A., Everson, R., & Fieldsend, J. (2017) 'Alternative infill strategies for expensive multi-objective optimisation', GECCO 2017 - Proceedings of the 2017 Genetic and Evolutionary Computation Conference, , pp. 873-880. ACM: Available at: https://doi.org/10.1145/3071178.3071276
