Computing a Finite Size Representation of the Set of Approximate Solutions of an MOP

Recently, a framework for the approximation of the entire set of $\epsilon$-efficient solutions (denote by $E_\epsilon$) of a multi-objective optimization problem with stochastic search algorithms has been proposed. It was proven that such an algorithm produces -- under mild assumptions on the process to generate new candidate solutions --a sequence of archives which converges to $E_{\epsilon}$ in the limit and in the probabilistic sense. The result, though satisfactory for most discrete MOPs, is at least from the practical viewpoint not sufficient for continuous models: in this case, the set of approximate solutions typically forms an $n$-dimensional object, where $n$ denotes the dimension of the parameter space, and thus, it may come to perfomance problems since in practise one has to cope with a finite archive.\\ Here we focus on obtaining finite and tight approximations of $E_\epsilon$, the latter measured by the Hausdorff distance. We propose and investigate a novel archiving strategy theoretically and empirically. For this, we analyze the convergence behavior of the algorithm, yielding bounds on the obtained approximation quality as well as on the cardinality of the resulting approximation, and present some numerical results.

[1]  Xavier Gandibleux,et al.  Metaheuristics for Multiobjective Optimisation , 2004, Lecture Notes in Economics and Mathematical Systems.

[2]  D. J. White,et al.  Epsilon-dominating solutions in mean-variance portfolio analysis , 1998, Eur. J. Oper. Res..

[3]  D. J. White,et al.  Epsilon efficiency , 1986 .

[4]  P. Loridan ε-solutions in vector minimization problems , 1984 .

[5]  Günter Rudolph,et al.  Convergence properties of some multi-objective evolutionary algorithms , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[6]  Marco Laumanns,et al.  Convergence of stochastic search algorithms to finite size pareto set approximations , 2008, J. Glob. Optim..

[7]  Emilio Carrizosa,et al.  A D.C. biobjective location model , 2002, J. Glob. Optim..

[8]  José Rui Figueira,et al.  Computing and Selecting-E ffi cient Solutions of { 0 , 1 }-Knapsack Problems , 2007 .

[9]  Kalyanmoy Deb,et al.  Evaluating the -Domination Based Multi-Objective Evolutionary Algorithm for a Quick Computation of Pareto-Optimal Solutions , 2005, Evolutionary Computation.

[10]  Günter Rudolph,et al.  Capabilities of EMOA to Detect and Preserve Equivalent Pareto Subsets , 2007, EMO.

[11]  E. Talbi,et al.  Approximating the -Efficient Set of an MOP with Stochastic Search Algorithms , 2007 .

[12]  Margaret M. Wiecek,et al.  Generating epsilon-efficient solutions in multiobjective programming , 2007, Eur. J. Oper. Res..

[13]  Günther Ruhe,et al.  ε-Optimality for bicriteria programs and its application to minimum cost flows , 1990, Computing.

[14]  Manohar P. Kamat,et al.  Multicriteria Optimization In Engineering: A Tutorial And Survey , 1993 .

[15]  S. Schäffler,et al.  Stochastic Method for the Solution of Unconstrained Vector Optimization Problems , 2002 .

[16]  Marco Laumanns,et al.  Combining Convergence and Diversity in Evolutionary Multiobjective Optimization , 2002, Evolutionary Computation.

[17]  Masahiro Tanaka,et al.  GA-based decision support system for multicriteria optimization , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.