A mesh adaptive direct search algorithm for multiobjective optimization

This work studies multiobjective optimization (MOP) of nonsmooth functions subject to general constraints. We first present definitions and optimality conditions as well as some single-objective formulations of MOP, parameterized with respect to some reference point in the space of objective functions. Next, we propose a new algorithm called MultiMads (multiobjective mesh adaptive direct search) for MOP. MultiMads generates an approximation of the Pareto front by solving a series of single-objective formulations of MOP generated using the NBI (natural boundary intersection) framework. These single-objective problems are solved using the Mads (mesh adaptive direct search) algorithm for constrained nonsmooth optimization. The Pareto front approximation is shown to satisfy some first-order necessary optimality conditions based on the Clarke calculus. MultiMads is then tested on problems from the literature with different Pareto front landscapes and on a styrene production process simulation problem from chemical engineering.

[1]  Marco Laumanns,et al.  Scalable Test Problems for Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.

[2]  H. W. Corley,et al.  Optimality conditions for maximizations of set-valued functions , 1988 .

[3]  Jaehee Kim,et al.  A CHIM-based interactive Tchebycheff procedure for multiple objective decision making , 2006, Comput. Oper. Res..

[4]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[5]  Charles Audet,et al.  A New Multi-objective Approach for the Portfolio Selection Problem with Skewness , 2007 .

[6]  P. Yu.  Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives , 1974 .

[7]  Charles Audet,et al.  Multiobjective Optimization Through a Series of Single-Objective Formulations , 2008, SIAM J. Optim..

[8]  Margaret M. Wiecek,et al.  A Survey of Approximation Methods in Multiobjective Programming , 2003 .

[9]  Charles Audet,et al.  Nonsmooth optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search , 2006, J. Glob. Optim..

[10]  Kalyanmoy Deb,et al.  Nonlinear goal programming using multi-objective genetic algorithms , 2001, J. Oper. Res. Soc..

[11]  D. Himmelblau,et al.  Optimization of Chemical Processes , 1987 .

[12]  L. Jain,et al.  Evolutionary multiobjective optimization : theoretical advances and applications , 2005 .

[13]  James M. Douglas,et al.  Conceptual Design of Chemical Processes , 1988 .

[14]  Charles Audet,et al.  A surrogate-model-based method for constrained optimization , 2000 .

[15]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[16]  Charles Audet,et al.  Mesh Adaptive Direct Search Algorithms for Constrained Optimization , 2006, SIAM J. Optim..

[17]  Warren D. Seider,et al.  Process design principles : synthesis, analysis, and evaluation , 1999 .

[18]  Klaus D. Timmerhaus,et al.  Plant design and economics for chemical engineers , 1958 .

[19]  A. J. Booker,et al.  A rigorous framework for optimization of expensive functions by surrogates , 1998 .

[20]  Royce Bowden,et al.  Simulation optimization research and development , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).

[21]  John E. Dennis,et al.  Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..

[22]  Charles Audet,et al.  OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions , 2008, SIAM J. Optim..

[23]  Charles Audet,et al.  Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm , 2007, SIAM J. Optim..

[24]  Meng Wang,et al.  Optimal Aeroacoustic Shape Design Using the Surrogate Management Framework , 2003 .