Skip to main navigation Skip to search Skip to main content

A Fast Dominance Move Calculation Using Mixed-Integer Programming for Many-objective Optimization

Research output: Contribution to journal › Article › peer-review

4 Downloads (Pure)

Abstract

The Dominance Move (DoM) is a binary quality indicator used to compare non-dominated solution sets in multi-and many-objective optimization. Despite its intuitive interpretation, the computational burden of calculating DoM is significant, as the complexity of existing mixed-integer programming (MIP) models scales poorly with the number of solutions. This paper proposes a new, compact MIP formulation that improves computational efficiency. Extensive experiments on 3 to 30-objective problems show that the proposed model reduces runtime by up to two orders of magnitude, thereby enhancing the practicality and applicability of the DoM indicator for real-world optimization problems.
Original languageEnglish
JournalIEEE Transactions on Evolutionary Computation
Early online date11 Mar 2026
DOIs
Publication statusE-pub ahead of print - 11 Mar 2026

Bibliographical note

This is an accepted manuscript of an article published in: C. L. d. V. Lopes, F. V. C. Martins, E. F. Wanner and K. Deb, "A Fast Dominance Move Calculation Using Mixed-Integer Programming for Many-objective Optimization," in IEEE Transactions on Evolutionary Computation, doi: 10.1109/TEVC.2026.3673109. For the purposes of open access the author/s has/ve applied a Creative Commons Attribution (CC BY) licence to any Author Accepted Manuscript (AAM) version arising from this submission.

Keywords

  • Mixed-integer programming
  • multi- and many-objective optimization
  • quality indicators

Fingerprint

Dive into the research topics of 'A Fast Dominance Move Calculation Using Mixed-Integer Programming for Many-objective Optimization'. Together they form a unique fingerprint.

Cite this