An Optimality Theory-Based Proximity Measure for Set-Based Multiobjective Optimization

Set-based multiobjective optimization methods, such as evolutionary multiobjective optimization (EMO) methods, attempt to find a set of Pareto-optimal solutions, instead of a single optimal solution. To evaluate these algorithms for their convergence to the efficient set in multiobjective optimization problems, the current performance metrics require the knowledge of the true Pareto-optimal solutions. In this paper, we develop a theoretically motivated Karush-Kuhn-Tucker proximity measure (KKTPM) that can provide an estimate of the proximity of a set of tradeoff solutions from the true Pareto-optimal solutions without any prior knowledge. Besides theoretical development of the proposed metric, the proposed KKTPM is computed for iteration-wise tradeoff solutions obtained from specific EMO algorithms on two-, three-, five-, and ten-objective optimization problems. Results amply indicate the usefulness of the proposed KKTPM as a metric for evaluating different sets of tradeoff solutions and also as a possible termination criterion for an EMO algorithm. Other possible uses of the proposed metric are also highlighted.

[1]  Jesús García,et al.  An approach to stopping criteria for multi-objective optimization evolutionary algorithms: The MGBM criterion , 2009, 2009 IEEE Congress on Evolutionary Computation.

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

[3]  Kalyanmoy Deb,et al.  Distributed computing of Pareto-optimal solutions using multi-objective evolutionary algorithms , 2003 .

[4]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[5]  Hussein A. Abbass,et al.  A dominance-based stability measure for multi-objective evolutionary algorithms , 2009, 2009 IEEE Congress on Evolutionary Computation.

[6]  Kalyanmoy Deb,et al.  Reference point based multi-objective optimization using evolutionary algorithms , 2006, GECCO.

[7]  Kalyanmoy Deb,et al.  A Computationally Fast and Approximate Method for Karush-Kuhn-Tucker Proximity Measure , 2015 .

[8]  丸山 徹 Convex Analysisの二,三の進展について , 1977 .

[9]  Kalyanmoy Deb,et al.  Light beam search based multi-objective optimization using evolutionary algorithms , 2007, 2007 IEEE Congress on Evolutionary Computation.

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

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

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

[13]  Marco Laumanns,et al.  Computing Gap Free Pareto Front Approximations with Stochastic Search Algorithms , 2010, Evolutionary Computation.

[14]  R. K. Ursem Multi-objective Optimization using Evolutionary Algorithms , 2009 .

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

[16]  A. Messac,et al.  Normal Constraint Method with Guarantee of Even Representation of Complete Pareto Frontier , 2004 .

[17]  Kalyanmoy Deb,et al.  Finding trade-off solutions close to KKT points using evolutionary multi-objective optimization , 2007, 2007 IEEE Congress on Evolutionary Computation.

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

[19]  Marco Laumanns,et al.  SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization , 2002 .

[20]  Kalyanmoy Deb,et al.  Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems , 1999, Evolutionary Computation.

[21]  Carlos A. Coello Coello,et al.  HCS: A New Local Search Strategy for Memetic Multiobjective Evolutionary Algorithms , 2010, IEEE Transactions on Evolutionary Computation.

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

[23]  R. Lyndon While,et al.  A faster algorithm for calculating hypervolume , 2006, IEEE Transactions on Evolutionary Computation.

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

[25]  J. M. Martínez,et al.  On sequential optimality conditions for smooth constrained optimization , 2011 .

[26]  Yacov Y. Haimes,et al.  Multiobjective Decision Making: Theory and Methodology , 1983 .

[27]  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.

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

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

[30]  Heike Trautmann,et al.  A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms , 2011, EMO.

[31]  Tong Heng Lee,et al.  Multiobjective Evolutionary Algorithms and Applications , 2005, Advanced Information and Knowledge Processing.

[32]  Pradyumn Kumar Shukla,et al.  On Gradient Based Local Search Methods in Unconstrained Evolutionary Multi-objective Optimization , 2007, EMO.

[33]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[34]  Kalyanmoy Deb,et al.  Faster Hypervolume-Based Search Using Monte Carlo Sampling , 2008, MCDM.

[35]  P. S. Manoharan,et al.  Evolutionary algorithm solution and KKT based optimality verification to multi-area economic dispatch , 2009 .

[36]  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.

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

[38]  Nicola Beume,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Gradient-based / Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric , 2007 .

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