Dominance Move: A Measure of Comparing Solution Sets in Multiobjective Optimization

One of the most common approaches for multiobjective optimization is to generate a solution set that well approximates the whole Pareto-optimal frontier to facilitate the later decision-making process. However, how to evaluate and compare the quality of different solution sets remains challenging. Existing measures typically require additional problem knowledge and information, such as a reference point or a substituted set of the Pareto-optimal frontier. In this paper, we propose a quality measure, called dominance move (DoM), to compare solution sets generated by multiobjective optimizers. Given two solution sets, DoM measures the minimum sum of move distances for one set to weakly Pareto dominate the other set. DoM can be seen as a natural reflection of the difference between two solutions, capturing all aspects of solution sets' quality, being compliant with Pareto dominance, and does not need any additional problem knowledge and parameters. We present an exact method to calculate the DoM in the biobjective case. We show the necessary condition of constructing the optimal partition for a solution set's minimum move, and accordingly propose an efficient algorithm to recursively calculate the DoM. Finally, DoM is evaluated on several groups of artificial and real test cases as well as by a comparison with two well-established quality measures.

[1]  Tobias Friedrich,et al.  Speeding up many-objective optimization by Monte Carlo approximations , 2013, Artif. Intell..

[2]  Hans-Paul Schwefel,et al.  Parallel Problem Solving from Nature — PPSN IV , 1996, Lecture Notes in Computer Science.

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

[4]  Richard L. Daniels,et al.  Analytical Evaluation of Multi-Criteria Heuristics , 1992 .

[5]  A. Farhang-Mehr,et al.  An Information-Theoretic Entropy Metric for Assessing Multi-Objective Optimization Solution Set Quality , 2003 .

[6]  Jyrki Wallenius,et al.  Quantitative Comparison of Approximate Solution Sets for Multicriteria Optimization Problems with Weighted Tchebycheff Preference Function , 2010, Oper. Res..

[7]  M. Hansen,et al.  Evaluating the quality of approximations to the non-dominated set , 1998 .

[8]  Serpil Sayin,et al.  The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm , 2005, Manag. Sci..

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

[10]  Mihalis Yannakakis,et al.  On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[11]  Hans Kellerer,et al.  Approximating Multiobjective Knapsack Problems , 2002, Manag. Sci..

[12]  Peter J. Fleming,et al.  On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers , 1996, PPSN.

[13]  Carlos A. Coello Coello,et al.  Using the Averaged Hausdorff Distance as a Performance Measure in Evolutionary Multiobjective Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[14]  Murat Köksalan,et al.  Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making , 2009, Oper. Res..

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

[16]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

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

[18]  David A. Van Veldhuizen,et al.  Evolutionary Computation and Convergence to a Pareto Front , 1998 .

[19]  Murat Köksalan,et al.  An Interactive Evolutionary Metaheuristic for Multiobjective Combinatorial Optimization , 2003, Manag. Sci..

[20]  Shengxiang Yang,et al.  A Performance Comparison Indicator for Pareto Front Approximations in Many-Objective Optimization , 2015, GECCO.

[21]  Arturo Hernández Aguirre,et al.  A Set of Test Cases for Performance Measures in Multiobjective Optimization , 2008, MICAI.

[22]  Tobias Friedrich,et al.  Efficient computation of two-dimensional solution sets maximizing the epsilon-indicator , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[23]  Hisao Ishibuchi,et al.  Modified Distance Calculation in Generational Distance and Inverted Generational Distance , 2015, EMO.

[24]  Eckart Zitzler,et al.  HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization , 2011, Evolutionary Computation.

[25]  Carlos M. Fonseca,et al.  Representation of the non-dominated set in biobjective discrete optimization , 2015, Comput. Oper. Res..

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

[27]  Yacov Y. Haimes,et al.  Research and Practice in Multiple Criteria Decision Making , 2000 .

[28]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

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

[30]  John W. Fowler,et al.  Quantitative Comparison of Approximate Solution Sets for Bi-criteria Optimization Problems , 2003, Decis. Sci..

[31]  Shapour Azarm,et al.  Metrics for Quality Assessment of a Multiobjective Design Optimization Solution Set , 2001 .

[32]  Joshua D. Knowles,et al.  On metrics for comparing nondominated sets , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[33]  Dirk Thierens,et al.  The balance between proximity and diversity in multiobjective evolutionary algorithms , 2003, IEEE Trans. Evol. Comput..

[34]  Shengxiang Yang,et al.  Diversity Comparison of Pareto Front Approximations in Many-Objective Optimization , 2014, IEEE Transactions on Cybernetics.

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

[36]  Stacey L. Faulkenberg,et al.  On the quality of discrete representations in multiple objective programming , 2010 .

[37]  Lothar Thiele,et al.  Quality Assessment of Pareto Set Approximations , 2008, Multiobjective Optimization.

[38]  Serpil Sayin,et al.  Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming , 2000, Math. Program..

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

[40]  Hisao Ishibuchi,et al.  A Study on Performance Evaluation Ability of a Modified Inverted Generational Distance Indicator , 2015, GECCO.

[41]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[42]  Lothar Thiele,et al.  A Tutorial on the Performance Assessment of Stochastic Multiobjective Optimizers , 2006 .

[43]  Kalyanmoy Deb,et al.  Multiple Criteria Decision Making, Multiattribute Utility Theory: Recent Accomplishments and What Lies Ahead , 2008, Manag. Sci..

[44]  Yaochu Jin,et al.  A Critical Survey of Performance Indices for Multi-Objective Optimisation , 2003 .

[45]  Yan Li,et al.  A Practical Guide to Select Quality Indicators for Assessing Pareto-Based Search Algorithms in Search-Based Software Engineering , 2016, 2016 IEEE/ACM 38th International Conference on Software Engineering (ICSE).

[46]  H. T. Kung,et al.  On the Average Number of Maxima in a Set of Vectors and Applications , 1978, JACM.

[47]  Michael Masin,et al.  Diversity Maximization Approach for Multiobjective Optimization , 2008, Oper. Res..

[48]  E. Polak,et al.  On Multicriteria Optimization , 1976 .

[49]  Jyrki Wallenius,et al.  Evaluation of nondominated solution sets for k , 2006, Eur. J. Oper. Res..