返回
A Novel Evolutionary Algorithm for Dynamic Constrained Multiobjective Optimization Problems
DOI:10.1109/TEVC.2019.2958075.png)
摘要
En 中文
To promote research on dynamic constrained multiobjective optimization, we first propose a group of generic test problems with challenging characteristics, including different modes of the true Pareto front (e.g., convexity-concavity and connectedness-disconnectedness) and the changing feasible region. Subsequently, motivated by the challenges presented by dynamism and constraints, we design a dynamic constrained multiobjective optimization algorithm with a nondominated solution selection operator, a mating selection strategy, a population selection operator, a change detection method, and a change response strategy. The designed nondominated solution selection operator can obtain a nondominated population with diversity when the environment changes. The mating selection strategy and population selection operator can adaptively handle infeasible solutions. If a change is detected, the proposed change response strategy reuses some portion of the old solutions in combination with randomly generated solutions to reinitialize the population, and a steady-state update method is designed to improve the retained previous solutions. The experimental results show that the proposed test problems can be used to clearly distinguish the performance of algorithms, and that the proposed algorithm is very competitive for solving dynamic constrained multiobjective optimization problems in comparison with state-of-the-art algorithms.
Keyword:
Optical fibers
Sociology
Statistics
Heuristic algorithms
Linear programming
Optimization
Convergence
Change response
dynamic constrained multiobjective optimization
population selection
test problems
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
Evolutionary Dynamic Multiobjective Optimization: Benchmarks and Algorithm Comparisons进化动态多目标优化: 基准和算法比较
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
Duality evolution: an efficient approach to constraint handling in multi-objective particle swarm optimization
SOFT COMPUTING
IF2.5

