SOCEMO: Surrogate Optimization of Computationally Expensive Multiobjective Problems

Juliane Müller ()
Additional contact information
Juliane Müller: Lawrence Berkeley National Lab, Center for Computational Sciences and Engineering, Berkeley, California 94720

INFORMS Journal on Computing, 2017, vol. 29, issue 4, 581-596

Abstract: We present the algorithm SOCEMO for optimization problems that have multiple conflicting computationally expensive black-box objective functions. The computational expense arising from the objective function evaluations considerably restricts the number of evaluations that can be done to find Pareto-optimal solutions. Frequently used multiobjective optimization methods are based on evolutionary strategies and generally require a prohibitively large number of function evaluations to find a good approximation of the Pareto front. SOCEMO, in contrast, employs surrogate models to approximate the expensive objective functions. These surrogate models are used in the iterative sampling process to decide at which points in the variable domain the next expensive evaluations should be done. Therefore, fewer expensive objective function evaluations are needed, and a good approximation of the Pareto front can be found efficiently. Previous algorithms have generally been tested on problems with few variables (up to 10) and few objective functions (up to 5). In our numerical study, we show that our algorithm performs well for benchmark problems with up to 35 dimensions and up to 10 objective functions, as well as two engineering application problems. We compared the performance of SOCEMO to a variant of NSGA-II and show that SOCEMO’s sophisticated search strategy is more efficient than NSGA-II when the number of allowable function evaluations is low.

Keywords: multiobjective optimization; surrogate models; black-box optimization; computationally expensive optimization; radial basis function (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1287/ijoc.2017.0749 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:29:y:2017:i:4:p:581-596

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().