Activities per year
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.
|Title of host publication||Proceedings of the 2011 IEEE Congress of Evolutionary Computation (CEC)|
|Publication status||Published - Jun 2011|
|Event||2011 IEEE Congress of Evolutionary Computation (CEC) - New Orleans, United States|
Duration: 5 Jun 2011 → 8 Jun 2011
|Conference||2011 IEEE Congress of Evolutionary Computation (CEC)|
|Period||5/06/11 → 8/06/11|
FingerprintDive into the research topics of 'A comparison of dominance criteria in many-objective optimization problems'. Together they form a unique fingerprint.
- 1 Participation in conference