DocumentCode
2693909
Title
Obtaining Better Non-Dominated Sets Using Volume Dominance
Author
Le, Khoi ; Landa-Silva, Dario
Author_Institution
Univ. of Nottingham, Nottingham
fYear
2007
fDate
25-28 Sept. 2007
Firstpage
3119
Lastpage
3126
Abstract
An important goal in multiobjective optimisation is to find a good set of non-dominated solutions that is both well-distributed and well-converged. Most multiobjective optimisation algorithms use the conventional Pareto dominance relationship. Over recent years, new approaches for the dominance relationship such as relaxed Pareto dominance, have been proposed. The interest in relaxed forms of Pareto dominance has been increasing due to their capability to find extreme values in the objective space. This paper conducts a short review on relaxed forms of Pareto dominance in the literature. A new form of relaxed Pareto dominance, called volume dominance, is presented afterward. The results based on comparison between volume dominance and Pareto dominance using SEAMO2, SPEA2 and NSGA2 show that the proposed volume dominance is capable of obtaining a better and smoother trade-off front, and it is more robust than Pareto dominance.
Keywords
Pareto optimisation; set theory; NSGA2; Pareto dominance relationship; SEAM02; SPEA2; multiobjective optimisation; nondominated sets; relaxed Pareto dominance; volume dominance; Computer science; Evolutionary computation; Information technology; Pareto optimization; Robustness;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2007. CEC 2007. IEEE Congress on
Conference_Location
Singapore
Print_ISBN
978-1-4244-1339-3
Electronic_ISBN
978-1-4244-1340-9
Type
conf
DOI
10.1109/CEC.2007.4424870
Filename
4424870
Link To Document