ParEGO extensions for multi-objective optimization of expensive evaluation functions


This paper deals with multi-objective optimization in the case of expensive objective functions. Such a problem arises frequently in engineering applications where the main purpose is to find a set of optimal solutions in a limited global processing time. Several algorithms use linearly combined criteria to use directly mono-objective algorithms. Nevertheless, other algorithms, such as multi-objective evolutionary algorithm (MOEA) and model-based algorithms, propose a strategy based on Pareto dominance to optimize efficiently all criteria. A widely used model-based algorithm for multi-objective optimization is Pareto efficient global optimization (ParEGO). It combines linearly the objective functions with several random weights and maximizes the expected improvement (EI) criterion. However, this algorithm tends to favor parameter values suitable for the reduction of the surrogate model error, rather than finding non-dominated solutions. The contribution of this article is to propose an extension of the ParEGO algorithm for finding the Pareto Front by introducing a double Kriging strategy. Such an innovation allows to calculate a modified EI criterion that jointly accounts for the objective function approximation error and the probability to find Pareto Set solutions. The main feature of the resulting algorithm is to enhance the convergence speed and thus to reduce the total number of function evaluations. This new algorithm is compared against ParEGO and several MOEA algorithms on a standard benchmark problems. Finally, an automotive engineering problem allowing to illustrate the applicability of B Joan Davins-Valldaura Saïd Moussaoui Guillermo Pita-Gil Franck Plestan 1 Renault, Technocentre, 78280 Guyancourt, France 2 IRCCyN, UMR CNRS, Ecole Centrale Nantes, 44321 Nantes, France

DOI: 10.1007/s10898-016-0419-3

9 Figures and Tables

Cite this paper

@article{DavinsValldaura2017ParEGOEF, title={ParEGO extensions for multi-objective optimization of expensive evaluation functions}, author={Joan Davins-Valldaura and Sa{\"{i}d Moussaoui and Guillermo Pita Gil and Franck Plestan}, journal={J. Global Optimization}, year={2017}, volume={67}, pages={79-96} }