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

02/01/2017
by   Miqing Li, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/10/2020

Dominance Move calculation using a MIP approach for comparison of multi and many-objective optimization solution sets

Dominance move (DoM) is a binary quality indicator that can be used in m...
research
04/18/2017

Simple Problems: The Simplicial Gluing Structure of Pareto Sets and Pareto Fronts

Quite a few studies on real-world applications of multi-objective optimi...
research
04/12/2022

Coevolutionary Pareto Diversity Optimization

Computing diverse sets of high quality solutions for a given optimizatio...
research
02/25/2020

An Assignment Problem Formulation for Dominance Move Indicator

Dominance move (DoM) is a binary quality indicator to compare solution s...
research
04/14/2022

Exact and approximate determination of the Pareto set using minimal correction subsets

Recently, it has been shown that the enumeration of Minimal Correction S...
research
12/06/2022

Pareto Optimal Compression of Genomic Dictionaries, with or without Random Access in Main Memory

Motivation: A Genomic Dictionary, i.e., the set of the k-mers appearing ...

Please sign up or login with your details

Forgot password? Click here to reset