A comparison of dominance criteria in many-objective optimization problems

Lucas S. Batista, Felipe Campelo, Frederico G. Guimaraes, Jaime A. Ramirez

Research output: Chapter in Book/Published conference outputConference publication

Abstract

In this paper, we analyze four dominance criteria in terms of their ability to adequately order sets of points in multi- and many-objective optimization problems. The use of relaxed and alternative dominance relationships has been an important tool for improving the performance of multiobjective evolutionary optimization algorithms, and their ordering ability is among the most important characteristics responsible for such improvement. Three relaxed formulations of dominance are investigated, along with the traditional Pareto ordering, in order to provide a comparison baseline. The results obtained show that all three relaxed dominance approaches presented greater robustness to the increase in the number of objectives, and are therefore more appropriate for use in many-objective optimization algorithms.
Original languageEnglish
Title of host publicationProceedings of the 2011 IEEE Congress of Evolutionary Computation (CEC)
PublisherIEEE
ISBN (Electronic)978-1-4244-7835-4
ISBN (Print)9781424478347
DOIs
Publication statusPublished - Jun 2011
Event2011 IEEE Congress of Evolutionary Computation (CEC) - New Orleans, United States
Duration: 5 Jun 20118 Jun 2011

Conference

Conference2011 IEEE Congress of Evolutionary Computation (CEC)
CountryUnited States
CityNew Orleans
Period5/06/118/06/11

Fingerprint

Dive into the research topics of 'A comparison of dominance criteria in many-objective optimization problems'. Together they form a unique fingerprint.
  • Best Student Paper

    Batista, L. S. (Recipient), Campelo, Felipe (Recipient), Guimarães, F. G. (Recipient) & Ramirez, J. A. (Recipient), 2011

    Prize: Prize (including medals and awards)

Cite this