A Study of the Naïve Objective Space Normalization Method in MOEA/D

Linjun He, Yang Nan, Ke Shang, H. Ishibuchi
{"title":"A Study of the Naïve Objective Space Normalization Method in MOEA/D","authors":"Linjun He, Yang Nan, Ke Shang, H. Ishibuchi","doi":"10.1109/SSCI44817.2019.9002938","DOIUrl":null,"url":null,"abstract":"Complex Pareto fronts with objectives in different scales usually appear in real-world multi-objective optimization problems. So as to treat different objectives equally, the naïve normalization method is frequently used due to its simplicity in calculating the estimated ideal and nadir points (i.e., without generating a hyperplane). By directly making use of information from the obtained solutions, the estimated ideal point and the estimated nadir point are obtained. However, the naïve normalization method has rarely been investigated. Moreover, its formulation is often different in each study in the literature. In this paper, we first show four different formulations of the naïve normalization. They are based on different estimation mechanisms of the ideal point and the nadir point. Next we investigate the effect of each formulation on the performance of MOEA/D. Our results show that the search behavior of MOEA/D is significantly impacted due to the choice of a formulation of the naïve normalization method. Finally we suggest the most effective formulation of the naïve normalization method for MOEA/D.","PeriodicalId":6729,"journal":{"name":"2019 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"60 1","pages":"1834-1840"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Symposium Series on Computational Intelligence (SSCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSCI44817.2019.9002938","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Complex Pareto fronts with objectives in different scales usually appear in real-world multi-objective optimization problems. So as to treat different objectives equally, the naïve normalization method is frequently used due to its simplicity in calculating the estimated ideal and nadir points (i.e., without generating a hyperplane). By directly making use of information from the obtained solutions, the estimated ideal point and the estimated nadir point are obtained. However, the naïve normalization method has rarely been investigated. Moreover, its formulation is often different in each study in the literature. In this paper, we first show four different formulations of the naïve normalization. They are based on different estimation mechanisms of the ideal point and the nadir point. Next we investigate the effect of each formulation on the performance of MOEA/D. Our results show that the search behavior of MOEA/D is significantly impacted due to the choice of a formulation of the naïve normalization method. Finally we suggest the most effective formulation of the naïve normalization method for MOEA/D.
Naïve MOEA/D目标空间归一化方法研究
在现实世界的多目标优化问题中,经常会出现不同尺度目标的复杂Pareto前沿。为了平等对待不同的目标,我们经常使用naïve归一化方法,因为它计算估计的理想点和最低点很简单(即不产生超平面)。直接利用得到的解的信息,得到了估计的理想点和估计的最低点。然而,naïve归一化方法很少被研究。此外,它的表述往往是不同的,在每一个研究文献。在本文中,我们首先展示了naïve归一化的四种不同形式。它们基于理想点和最低点的不同估计机制。接下来,我们研究了每种配方对MOEA/D性能的影响。我们的研究结果表明,由于选择naïve归一化方法的公式,MOEA/D的搜索行为受到显著影响。最后提出了最有效的naïve MOEA/D归一化方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信