.png){kind=icon}
返回
Dynamic grid-based uniform search for solving constrained multiobjective optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s12293-021-00349-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
When solving constrained multiobjective optimization problems (CMOPs), it is important to uniformly explore the promising regions that are not dominated by feasible solutions, and this can effectively avoid the loss of the Pareto front fragments. To achieve this, we propose a grid-based uniform search (GUS) to guide the current population to search the promising areas uniformly in this paper. Therein, the promising areas are divided into a number of grids, which are then fully explored by the individuals located in them. In the process of reducing the population size, the individuals with the largest constraint violations in the most crowded grids are removed one by one. To balance the local search and the global search, we dynamically reduce the number of divided grids in GUS with the increase of evolutionary iterations. Embedding the dynamic GUS in evolutionary algorithm, we design a new constrained algorithms for CMOPs. Experimental results show that the proposed algorithm performs better than other state-of-the-art constrained evolutionary multiobjective optimization algorithms in dealing with different CMOPs.
Keyword:
Uniform search
Grid search
Dynamic
Multiobjective optimization
Evolutionary algorithm
期刊
IF:
2.3
论文数:
453
被引数:
718
机构
引用论文
分享收藏
From Multitask Gradient Descent to Gradient-Free Evolutionary Multitasking: A Proof of Faster Convergence从多任务梯度下降到无梯度进化多任务: 更快收敛的证明
PREAI
分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏分享收藏Alleviative effects of different kinds of exogenous polyamines on salt inj ury of Soybean seedlings.png)
IF0
PREAI
分享收藏Solving binary multi-objective knapsack problems with novel greedy strategyMEMETIC COMPUTING
MEMETIC COMPUTINGIF2.3
PREAI
分享收藏
查看更多内容