Runtime Analysis of Typical Decomposition Approaches in MOEA/D for Many-Objective Optimization Problems

分解 计算机科学 数学优化 多目标优化 进化算法 数学 化学 有机化学
作者
Zhengxin Huang,Yuren Zhou,Zefeng Chen,Qianlong Dang
出处
期刊:Evolutionary Computation [The MIT Press]
卷期号:34 (3): 307-339
标识
DOI:10.1162/evco_a_00364
摘要

Decomposition-based multiobjective evolutionary algorithms (MOEAs) are popular methods utilized to address many-objective optimization problems (MaOPs). These algorithms decompose the original MaOP into several scalar optimization subproblems, and solve them to obtain a set of solutions to approximate the Pareto front (PF). The decomposition approach is an important component in them. This paper presents a runtime analysis of a MOEA based on the classic decomposition framework using the typical weighted sum (WS), Tchebycheff (TCH), and penalty-based boundary intersection (PBI) approaches to obtain an optimal solution for any subproblem of two pseudo-Boolean benchmark MaOPs, namely mLOTZ and mCOCZ. Due to the complexity and limitation of the theoretical analysis techniques, the analyzed algorithm employs 1-bit mutation to generate offspring individuals. The results indicate that when using WS, the analyzed algorithm can consistently find an optimal solution for every subproblem, which is located in the PF, in polynomial expected runtime. In contrast, the algorithm requires at least exponential expected runtime (with respect to the number of objectives m) for certain subproblems when using TCH or PBI, even though the landscapes of all objective functions in the two benchmarks are strictly monotone. Moreover, this analysis reveals a drawback of using WS: the optimal solutions obtained by solving subproblems are more easily mapped to the same point in the PF, compared to the case of using TCH. When using PBI, a smaller value of the penalty parameter is a good choice for faster convergence to the PF but may compromise diversity. To further understand the impact of these approaches in practical algorithms, numerical experiments on using bit-wise mutation to generate offspring individuals are conducted. The findings of this study may be helpful for designing more efficient decomposition approaches for MOEAs in future research.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
张伟发布了新的文献求助10
刚刚
文献完成签到,获得积分10
1秒前
传奇3的应助被ghr777采纳,获得10
1秒前
su发布了新的文献求助10
2秒前
2秒前
aniannn发布了新的文献求助10
2秒前
hdy331完成签到,获得积分0
2秒前
Gloria2023发布了新的文献求助20
3秒前
3秒前
selena发布了新的文献求助10
4秒前
明理夜安完成签到 ,获得积分10
4秒前
Bruce_Wayne发布了新的文献求助30
4秒前
5秒前
瘦瘦从梦发布了新的文献求助10
5秒前
英俊的铭的应助被chenggeyi采纳,获得10
5秒前
6秒前
好运桶桶来完成签到 ,获得积分10
6秒前
7秒前
权瑞松发布了新的文献求助10
7秒前
7秒前
7秒前
JamesPei的应助被暨南伱采纳,获得30
8秒前
Ian完成签到,获得积分10
8秒前
8秒前
9秒前
欧斯奥特曼完成签到 ,获得积分10
9秒前
9秒前
sunsuan发布了新的文献求助10
9秒前
10秒前
王伟发布了新的文献求助10
10秒前
深情安青的应助被温暖砖头采纳,获得10
11秒前
11秒前
CodeCraft的应助被Gloria2023采纳,获得10
12秒前
路阳完成签到 ,获得积分10
12秒前
Akim的应助被热情的远锋采纳,获得10
12秒前
12秒前
xxx发布了新的文献求助10
12秒前
顺利怜菡发布了新的文献求助30
13秒前
xiongxiangyu123完成签到,获得积分20
13秒前
程朗发布了新的文献求助10
13秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
八旗制度の研究 600
Improving the wear resistance of vehicle gear oil by oil soluble LaF3 nanoparticles and typical additives of gear oil 500
Boundaries and Bodhisattvas 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8183241
求助须知:如何正确求助?哪些是违规求助? 9572493
关于积分的说明 21826218
捐赠科研通 7780115
什么是DOI,文献DOI怎么找? 3433982
关于科研通互助平台的介绍 2558103
邀请新用户注册赠送积分活动 2480192