A comparison of dominance criteria in many-objective optimization problems

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

doi:10.1109/cec.2011.5949909

A comparison of dominance criteria in many-objective optimization problems

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

College of Engineering and Physical Sciences

Research output: Chapter in Book/Published conference output › Conference 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 language	English
Title of host publication	Proceedings of the 2011 IEEE Congress of Evolutionary Computation (CEC)
Publisher	IEEE
ISBN (Electronic)	978-1-4244-7835-4
ISBN (Print)	9781424478347
DOIs	https://doi.org/10.1109/cec.2011.5949909
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

Conference	2011 IEEE Congress of Evolutionary Computation (CEC)
Country/Territory	United States
City	New Orleans
Period	5/06/11 → 8/06/11

Access to Document

10.1109/cec.2011.5949909

Cite this

@inproceedings{c7f293c093a749089b6bdc18a08ee9bd,

title = "A comparison of dominance criteria in many-objective optimization problems",

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.",

author = "Batista, {Lucas S.} and Felipe Campelo and Guimaraes, {Frederico G.} and Ramirez, {Jaime A.}",

year = "2011",

month = jun,

doi = "10.1109/cec.2011.5949909",

language = "English",

isbn = "9781424478347",

booktitle = "Proceedings of the 2011 IEEE Congress of Evolutionary Computation (CEC)",

publisher = "IEEE",

address = "United States",

note = "2011 IEEE Congress of Evolutionary Computation (CEC) ; Conference date: 05-06-2011 Through 08-06-2011",

}

TY - GEN

T1 - A comparison of dominance criteria in many-objective optimization problems

AU - Batista, Lucas S.

AU - Campelo, Felipe

AU - Guimaraes, Frederico G.

AU - Ramirez, Jaime A.

PY - 2011/6

Y1 - 2011/6

N2 - 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.

AB - 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.

UR - https://ieeexplore.ieee.org/document/5949909

U2 - 10.1109/cec.2011.5949909

DO - 10.1109/cec.2011.5949909

M3 - Conference publication

SN - 9781424478347

BT - Proceedings of the 2011 IEEE Congress of Evolutionary Computation (CEC)

PB - IEEE

T2 - 2011 IEEE Congress of Evolutionary Computation (CEC)

Y2 - 5 June 2011 through 8 June 2011

ER -

A comparison of dominance criteria in many-objective optimization problems

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Best Student Paper

2011 IEEE Congress of Evolutionary Computation (CEC)

Cite this

A comparison of dominance criteria in many-objective optimization problems

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Prizes

Best Student Paper

Activities

2011 IEEE Congress of Evolutionary Computation (CEC)

Cite this