返回
A decomposition-based multi-objective evolutionary algorithm using infinitesimal method
DOI:10.1016/j.asoc.2024.112272.png)
摘要
En 中文
Multi-Objective Evolutionary Algorithm based on decomposition (MOEA/D) has been extensively employed to address a diverse array of real-world challenges and has shown excellent performance. However, the initial collection of aggregate weight vectors proves unsuitable for multi-objective optimization problems (MOPs) featuring intricate Pareto front (PF) structures, and the solving performance will be greatly affected when MOEA/D solves these irregular MOPs. In light of these challenges, a refined MOEA/D algorithm utilizing infinitesimal method is proposed. This algorithm incorporates the notion of global decomposition stemming from infinitesimal method to streamline the feature information of PF, thereby facilitating the adjustment of the weight vector towards optimal distribution. Consequently, enhancements in resource allocation efficiency and algorithmic performance are achieved. In the empirical investigation, the algorithm's performance is tested on 28 benchmarks from ZDT,DTLZ and WFG test suits. Wilcoxon's rank-sum test and Fredman's test were carried out on performance metrics, which proved that the proposed MOEA/D-DKS was superior to other comparison algorithms.
Keyword:
Multi-objective evolutionary algorithm
Decomposition
Infinitesimal method
Weight vector adjustment
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
An Improved Multiobjective Optimization Evolutionary Algorithm Based on Decomposition for Complex Pareto Fronts一种改进的基于复杂帕累托前沿分解的多目标优化进化算法
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms关于使用非参数统计检验作为比较进化和群体智能算法的方法的实用教程

