Obtaining better non-dominated sets using volume dominance

Le, Khoi; Landa-Silva, Dario

Abstract

An important goal in multiobjective optimisation is to And 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 And 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. © 2007 IEEE.

Citation

Le, K., & Landa-Silva, D. (2007, September). Obtaining better non-dominated sets using volume dominance. Presented at 2007 IEEE Congress on Evolutionary Computation, CEC 2007, Singapore

• Presentation Conference Type: Conference Paper (published)
• Conference Name: 2007 IEEE Congress on Evolutionary Computation, CEC 2007
• Start Date: Sep 25, 2007
• End Date: Sep 28, 2007
• Online Publication Date: Jan 7, 2008
• Publication Date: Dec 1, 2007
• Deposit Date: Feb 10, 2020
• Publisher: Institute of Electrical and Electronics Engineers
• Pages: 3119-3126
• Book Title: 2007 IEEE Congress on Evolutionary Computation
• ISBN: 9781424413393
• DOI: https://doi.org/10.1109/CEC.2007.4424870
• Public URL: https://nottingham-repository.worktribe.com/output/3088177
• Publisher URL: https://ieeexplore.ieee.org/document/4424870