A Survey of Normalization Methods in Multiobjective Evolutionary Algorithms.

Saved in:
Bibliographic Details
Title: A Survey of Normalization Methods in Multiobjective Evolutionary Algorithms.
Authors: He, Linjun1 (AUTHOR) this.helj@gmail.com, Ishibuchi, Hisao1 (AUTHOR) hisao@sustech.edu.cn, Trivedi, Anupam2 (AUTHOR) eleatr@nus.edu.sg, Wang, Handing3 (AUTHOR) hdwang@xidian.edu.cn, Nan, Yang1 (AUTHOR) nany@mail.sustech.edu.cn, Srinivasan, Dipti2 (AUTHOR) dipti@nus.edu.sg
Source: IEEE Transactions on Evolutionary Computation. Dec2021, Vol. 25 Issue 6, p1028-1048. 21p.
Subjects: Fix-point estimation, Evolutionary computation, Mathematical optimization
Abstract: A real-world multiobjective optimization problem (MOP) usually has differently scaled objectives. Objective space normalization has been widely used in multiobjective optimization evolutionary algorithms (MOEAs). Without objective space normalization, most of the MOEAs may fail to obtain uniformly distributed and well-converged solutions on MOPs with differently scaled objectives. Objective space normalization requires information on the Pareto front (PF) range, which can be acquired from the ideal and nadir points. Since the ideal and nadir points of a real-world MOP are usually not known a priori, many recently proposed MOEAs tend to estimate and update the two points adaptively during the evolutionary process. Different methods to estimate ideal and nadir points have been proposed in the literature. Due to inaccurate estimation of the two points (i.e., inaccurate estimation of the PF range), objective space normalization may deteriorate the performance of an MOEA. Different methods have also been proposed to alleviate the negative effects of inaccurate estimation. This article presents a comprehensive survey of objective space normalization methods, including ideal point estimation methods, nadir point estimation methods, and different methods based on the utilization of the estimated PF range. [ABSTRACT FROM AUTHOR]
Copyright of IEEE Transactions on Evolutionary Computation is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Be the first to leave a comment!
You must be logged in first