Analyzing Dominance Move (MIP-DoM) Indicator for Multi- and Many-objective Optimization
Claudio Lucio do Val Lopes, Fl\'avio Vin\'icius Cruzeiro Martins,, Elizabeth Fialho Wanner, Kalyanmoy Deb

TL;DR
This paper introduces a mixed integer programming approach to efficiently compute the dominance move (DoM) indicator for multi- and many-objective optimization, overcoming previous computational limitations especially in higher dimensions.
Contribution
The work proposes a novel MIP-based method to calculate DoM for three or more objectives, extending its applicability beyond bi-objective cases and addressing computational challenges.
Findings
MIP-DoM accurately computes DoM in bi-objective cases.
The method scales to higher dimensions, handling up to 30 objectives.
Experiments demonstrate the model's correctness and efficiency.
Abstract
Dominance move (DoM) is a binary quality indicator that can be used in multi-objective and many-objective optimization to compare two solution sets obtained from different algorithms. The DoM indicator can differentiate the sets for certain important features, such as convergence, spread, uniformity, and cardinality. DoM does not use any reference, and it has an intuitive and physical meaning, similar to the -indicator, and calculates the minimum total move of members of one set so that all elements in another set are to be dominated or identical to at least one member of the first set. Despite the aforementioned properties, DoM is hard to calculate, particularly in higher dimensions. There is an efficient and exact method to calculate it in a bi-objective case only. This work proposes a novel approach to calculate DoM using a mixed integer programming (MIP) approach, which…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
