Design and application of MOEA/D with adaptive penalty strategy

KE Yong-bin; ZHOU Hong-bia

Chinese

您当前的位置：

首页 >

文章列表页 >

Design and application of MOEA/D with adaptive penalty strategy

更新时间：2026-09-04

- Design and application of MOEA/D with adaptive penalty strategy
- Vol. 37, Issue 7, Pages: 59-65(2020)
- 作者机构：
  
  1. 淮阴工学院机构电子信息工程学院,江苏,淮安,223001
  2. 淮阴工学院自动化学院,江苏,淮安,223001
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：2020
- 稿件说明：
移动端阅览
柯永斌, 周红标. 基于自适应惩罚策略的MOEA/D算法设计及应用[J]. 微电子学与计算机, 2020, 37(7): 59-65.

KE Yong-bin, ZHOU Hong-bia. Design and application of MOEA/D with adaptive penalty strategy[J]. 2020, 37(7): 59-65.
柯永斌, 周红标. 基于自适应惩罚策略的MOEA/D算法设计及应用[J]. 微电子学与计算机, 2020, 37(7): 59-65. DOI：

KE Yong-bin, ZHOU Hong-bia. Design and application of MOEA/D with adaptive penalty strategy[J]. 2020, 37(7): 59-65. DOI：

摘要

基于分解的多目标进化算法(Multiobjective evolutionary algorithm based on decomposition

MOEA/D)将一个多目标优化问题(multiobjective optimization problem

MOP)分解成一系列的单目标优化子问题

然后利用相互协作的进化方式优化这些子问题. MOEA/D利用独特的分解机制促进种群逼近Pareto最优前端(Pareto optimal front

POF)

同时利用均匀分布的权重向量维护种群的多样性

在解决MOPs时具有较大的优势.但是

在实际工程中

大多数MOPs的POF具有复杂的特性.比如说POF可能具有长尾和顶点

这极大地降低了MOEA/D算法的性能.基于惩罚的边界交集法(penalty-based boundary intersection

PBI)是MOEA/D常用的分解方法之一.在PBI法中

惩罚因子起着平衡算法收敛性和多样性的关键作用.本文提出了一种自适应惩罚策略(adaptive penalty strategy

APS)

能够在进化过程中自适应调整每个权重向量对应的惩罚因子值

有效地增强了近似Pareto前端的多样性.最后

利用六个具有复杂POF的基准MOPs和空间桁架结构多目标优化实验验证了所提MOEA/D-APS算法的有效性.

Abstract

Multiobjective evolutionary algorithm based on decomposition (MOEA/D) decomposes a multiobjective optimization problem (MOP) into a number of scalar optimization subproblems and optimizes them in a collaborative manner. In MOEA/D

decomposition mechanisms are used to push the population to approach the Pareto optimal front (POF)

whilst a set of uniformly distributed weight vectors are applied to maintain the diversity of the population. MOEA/D has been shown to be very efficient in solving MOPs. However

the POF of many MOPs has complex characteristics

which significantly degrades the performance of MOEA/D. Penalty-based boundary intersection (PBI) is one of the frequently used decomposition approaches. In PBI approach

penalty factor plays a crucial role in balancing convergence and diversity. This paper proposes an adaptive penalty strategy (APS) which can dynamically adjust the value of the penalty factor for each weight vector during the evolutionary process. The diversity of approximated Pareto front can be enhanced by using this APS approach. The performance of the proposed MOEA/D-APS algorithm is investigated on six newly designed benchmark MOPs with complex POF shapes and the multiobjective optimization of space truss structure.

关键词

Keywords

references

WANG Z K, ZHANG Q F, ZHOU A, et al. Adaptive replacement strategies for MOEA/D[J]. IEEE Transactions on Cybernetics, 2016, 46(2): 474-486. DOI: 474

LI K, ZHANG Q F, KWONG S, et al. Stable matching-based selection in evolutionary multiobjective optimization[J]. IEEE Transactions on Evolutionary Computation, 2014, 18(6): 909-923. DOI: 909

COELLO C A C, PULIDO G T, Lechuga M S. Handling multiple objectives with particle swarm optimization[J]. IEEE Transactions on Evolutionary Computation, 2004, 8(3): 256-279. DOI: 256

Qi Y, Ma X, Liu F, et al. MOEA/D with adaptive weight adjustment[J]. Evolutionary Computation, 2014, 22(2): 231-264. DOI: 231

ZHOU H, QIAO J F. Multiobjective optimal control for wastewater treatment process using adaptive MOEA/D[J]. Applied Intelligence, 2019, 49(3): 1098-1126. DOI: 1098

JIANG S Y, YANG S X.An improved multiobjective optimization evolutionary algorithm based on decomposition for complex Pareto fronts[J]. IEEE Transactions on Cybernetics, 2016, 46(2): 421-437. DOI: 421

LI H, ZHANG Q F. Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-Ⅱ[J]. IEEE Transactions on Evolutionary Computation, 2009, 13(2): 284-302. DOI: 284

YANG S X, JIANG S Y, JIANG Y. Improving the multiobjective evolutionary algorithm based on decomposition with new penalty schemes[J]. Soft Computing, 2017, 21(16): 4677-4691. DOI: 4677

BADER J, ZITZLER E. HypE: An algorithm for fast hypervolume-based many-objective optimization[J]. Evolutionary Computation, 2011, 19(1): 45-76. DOI: 45

WU M, LI K, KWONG S, et al. Matching-based selection with incomplete lists for decomposition multi-objective optimization[J]. IEEE Transactions on Evolutionary Computation, 2017, 21(4): 554-568. DOI: 554

JASZKIEWICZ A. On the performance of multiple-objective genetic local search on the 0/1 knapsack problem-a comparative experiment[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(4): 402-412. DOI: 402

ZHANG Q F, LI H. MOEA/D: A multiobjective evolutionary algorithm based on decomposition[J]. IEEE Transactions on Evolutionary Computation, 2007, 11(6): 712-731. DOI: 712

LI K, KWONG S, ZHANG Q F, et al. Interrelationship-based selection for decomposition multiobjective optimization[J]. IEEE Transactions on Cybernetics, 2015, 45(10): 2076-2088. DOI: 2076

SATO H. Inverted PBI in MOEA/D and its impact on the search performance on multi and many-objective optimization[C]//Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation. ACM, 2014: 645-652.

DEB K, PRATAP A, AGARWAL S, et al. A fast and elitist multiobjective genetic algorithm: NSGA-Ⅱ[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(2): 182-197. DOI: 182

HO-HUU V, HARTJES S, VISSER H G, et al. An improved MOEA/D algorithm for bi-objective optimization problems with complex Pareto fronts and its application to structural optimization[J]. Expert Systems with Applications, 2018(92): 430-446. DOI: 430

TRIVEDI A, SRINIVASAN D, SANYALK, et al. A survey of multiobjective evolutionary algorithms based on decomposition[J]. IEEE Transactions on Evolutionary Computation, 2017, 21(3): 440-462. DOI: 440

BEUME N, NAUJOKS B, EMMERICH M. SMS-EMOA: Multiobjective selection based on dominated hypervolume[J]. European Journal of Operational Research, 2007, 181(3): 1653-1669. DOI: 1653

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Research on assembly action recognition based on MSS-YOLO-MPHands fusion architecture

Steganography model guided by attention mechanism and improved dense convolution

Lightweight countermeasures against Spectre attacks on the branch prediction unit

A feature-oriented context understanding and slice analysis network for tuberculosis detection

Research on the design of blockchain-based AI-generated content traceability framework

Related Author

No data

Related Institution

No data

AI问答

Postal code：100079
Tel：（010）53879206 Email：tmw@bjxintong.com.cn
Technical support is provided by Beijing Founder electronics co., LTD 京ICP备09082226号-64 京公网安备11010602201714号
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰