A smooth proximity measure for optimality in multi-objective optimization using Benson's method

Abstract Multi-objective optimization problems give rise to a set of trade-off Pareto-optimal solutions. To evaluate a set-based multi-objective optimization algorithm, such as an evolutionary multi-objective optimization (EMO) algorithm, for its convergence and diversity attainment, more than one performance metrics are required. To measure the convergence aspect, a new Karush-Kuhn-Tucker proximity measure (KKTPM) was recently proposed based on the extent of satisfaction of KKT optimality conditions on the augmented achievement scalarization function (AASF) formulation. However, the Pareto-optimality of a point depends on a parameter needed to be used in the AASF formulation. In this paper, we use Benson’s method as a scalarized version of the multi-objective optimization problem, mainly because it is parameter-less and is a popularly used in the multi-criterion decision-making (MCDM) literature. The proposed Benson’s method based metric (B-KKTPM) is applied to optimized solutions of popular EMO algorithms on standard two to 10-objective test problems and to a few engineering design problems. B-KKTPM is able to determine relative closeness of a set of trade-off solutions from the strictly efficient solutions without any prior knowledge of them. To reduce the computational cost of solving an optimization problem to compute B-KKTPM, we also propose a direct, but approximate, method. The obtained results from our extensive study indicates that (i) the proposed optimization based and direct B-KKTPMs can be used for a termination check for any optimization algorithm, and (ii) the direct B-KKTPM method can be used as a replacement of the optimization-based version for a good trade-off between computational time and accuracy.

[1]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.

[2]  Marco Laumanns,et al.  Scalable multi-objective optimization test problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[3]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[4]  Kalyanmoy Deb,et al.  On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods , 2007, Eur. J. Oper. Res..

[5]  David Corne,et al.  The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[6]  Gabriel Haeser,et al.  On Approximate KKT Condition and its Extension to Continuous Variational Inequalities , 2011, J. Optim. Theory Appl..

[7]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach , 2014, IEEE Transactions on Evolutionary Computation.

[8]  Kalyanmoy Deb,et al.  Multiphase Balance of Diversity and Convergence in Multiobjective Optimization , 2019, IEEE Transactions on Evolutionary Computation.

[9]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[10]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[11]  Kalyanmoy Deb,et al.  Towards faster convergence of evolutionary multi-criterion optimization algorithms using Karush Kuhn Tucker optimality based local search , 2017, Comput. Oper. Res..

[12]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[13]  Andrzej P. Wierzbicki,et al.  The Use of Reference Objectives in Multiobjective Optimization , 1979 .

[14]  J. B. G. Frenk,et al.  An Elementary Proof of the Fritz-John and Karush-Kuhn-Tucker Conditions in Nonlinear Programming , 2005, Eur. J. Oper. Res..

[15]  José Mario Martínez,et al.  A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences , 2010, SIAM J. Optim..

[16]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[17]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[18]  C. Fonseca,et al.  GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION , 1993 .

[19]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[20]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[21]  C. R. Bector,et al.  Principles of Optimization Theory , 2005 .

[22]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

[23]  Matthias Ehrgott,et al.  Multicriteria Optimization , 2005 .

[24]  Kalyanmoy Deb,et al.  An Optimality Theory-Based Proximity Measure for Set-Based Multiobjective Optimization , 2016, IEEE Transactions on Evolutionary Computation.

[25]  Kalyanmoy Deb,et al.  Karush-Kuhn-Tucker Proximity Measure for Multi-Objective Optimization Based on Numerical Gradients , 2016, GECCO.

[26]  H. P. Benson,et al.  Existence of efficient solutions for vector maximization problems , 1978 .

[27]  Kalyanmoy Deb,et al.  A Computationally Fast Convergence Measure and Implementation for Single-, Multiple-, and Many-Objective Optimization , 2017, IEEE Transactions on Emerging Topics in Computational Intelligence.

[28]  Kalyanmoy Deb,et al.  Investigating EA solutions for approximate KKT conditions in smooth problems , 2010, GECCO '10.

[29]  Kalyanmoy Deb,et al.  Approximate KKT points and a proximity measure for termination , 2013, J. Glob. Optim..