.png){kind=icon}
返回
Parallel cooperative multiobjective coevolutionary algorithm for constrained multiobjective optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2024.111290.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The existing parallel multiobjective evolutionary computation does not perform well for constrained multiobjective optimization problems with discontinuous Pareto fronts or narrow feasible regions. This study parallelizes the state-of-the-art cooperative multiobjective coevolutionary algorithm and proposes an effective parallel evolutionary algorithm for constrained multiobjective optimization problems that are difficult to optimize. Two parallelization methods are compared: a global parallel model in which solution evaluations are performed in parallel, and a hybrid model that treats the cooperative populations in a distributed manner while performing each solution evaluation in parallel. The first model is a straightforward parallelization, while the second one capitalizes on the characteristics of the coevolutionary framework. To investigate the efficacy of the proposed models, experiments are conducted on constrained multiobjective optimization problems, including complex characteristics, while varying the number of parallel cores up to 64. The experiments compare the two proposed methods from the viewpoint of search performance and execution time. The experimental results reveal that the latter hybrid model shows better computational efficiency and scalability against an increasing number of cores without adversely affecting the search performance compared to the former straightforward parallelization.
Keyword:
Multiobjective evolutionary algorithm
Constrained optimization problem
Parallelization
Speedup
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Optimization of hydropower reservoirs operation balancing generation benefit and ecological requirement with parallel multi-objective genetic algorithm.png)
ENERGY
ENERGYIF9.4
PREAI
分享收藏分享收藏An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regionsSOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏
查看更多内容