An enhanced MOEA/D using uniform directions and a pre-organization procedure

Rui Wang, Zhang Tao, Bo Guo
{"title":"An enhanced MOEA/D using uniform directions and a pre-organization procedure","authors":"Rui Wang, Zhang Tao, Bo Guo","doi":"10.1109/CEC.2013.6557855","DOIUrl":null,"url":null,"abstract":"Multi-objective evolutionary algorithm based on decomposition (MOEA/D) has become increasingly popular in solving multi-objective problems (MOPs). In MOEA/D, weight vectors are responsible for maintaining a nice distribution of Pareto optimal solutions. Often, we expect to obtain a set of uniformly distributed solutions by applying a set of uniformly distributed weight vectors in MOEA/D. In this paper, we argue that uniformly distributed weights do not produce uniformly distributed solutions, however, uniformly distributed search directions do. Moreover, we propose to perform a pre-organization procedure before running MOEA/D. The procedure matches each weight to its closet candidate solution. Experimental results show (i) MOEA/D with uniformly distributed search directions would exhibit a better diversity performance, and (ii) MOEA/D with the pre-organization procedure performs better, especially for the convergence performance.","PeriodicalId":211988,"journal":{"name":"2013 IEEE Congress on Evolutionary Computation","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Congress on Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2013.6557855","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

Abstract

Multi-objective evolutionary algorithm based on decomposition (MOEA/D) has become increasingly popular in solving multi-objective problems (MOPs). In MOEA/D, weight vectors are responsible for maintaining a nice distribution of Pareto optimal solutions. Often, we expect to obtain a set of uniformly distributed solutions by applying a set of uniformly distributed weight vectors in MOEA/D. In this paper, we argue that uniformly distributed weights do not produce uniformly distributed solutions, however, uniformly distributed search directions do. Moreover, we propose to perform a pre-organization procedure before running MOEA/D. The procedure matches each weight to its closet candidate solution. Experimental results show (i) MOEA/D with uniformly distributed search directions would exhibit a better diversity performance, and (ii) MOEA/D with the pre-organization procedure performs better, especially for the convergence performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用统一的方向和预先组织程序增强MOEA/D
基于分解的多目标进化算法(MOEA/D)在求解多目标问题中得到了越来越广泛的应用。在MOEA/D中,权重向量负责维持Pareto最优解的良好分布。通常,我们期望通过在MOEA/D中应用一组均匀分布的权向量来获得一组均匀分布的解。在本文中,我们认为均匀分布的权值不能产生均匀分布的解,但是均匀分布的搜索方向可以。此外,我们建议在运行MOEA/D之前执行预组织程序。该过程将每个权重与其最接近的候选解进行匹配。实验结果表明,采用均匀分布搜索方向的MOEA/D算法具有较好的分集性能,采用预组织方法的MOEA/D算法具有较好的收敛性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A study on two-step search based on PSO to improve convergence and diversity for Many-Objective Optimization Problems An evolutionary approach to the multi-objective pickup and delivery problem with time windows A new performance metric for user-preference based multi-objective evolutionary algorithms A new algorithm for reducing metaheuristic design effort Evaluation of gossip Vs. broadcast as communication strategies for multiple swarms solving MaOPs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1