返回
MOEA/UE: A novel multi-objective evolutionary algorithm using a uniformly evolving scheme
DOI:10.1016/j.neucom.2020.04.149.png)
摘要
En 中文
In multi-objective optimization, the Pareto-optimal solutions must be widely and uniformly distributed on the Pareto-optimal front. When this condition is satisfied, decision makers can choose satisfactory solutions. In this paper, gaps in the evolving nondominated front are filled by a multi-objective evolutionary algorithm using a uniformly evolving scheme (MOEA/UE), thus generating a uniform and wide Pareto-optimal front. The MOEA/UE first calculates the distance between the points on the nondominated front and identifies those with relatively wide gaps. At the widely spaced points, the objective and constraint functions are approximated by linear functions expressed as Taylor series in auxiliary linear programs. Finally, the MOEA/UE solves these auxiliary linear programs and retains the optimal or intermediate solutions as the potentially superior individuals that will be selected in the next generation of the population. Convergence toward potentially superior solutions is accelerated by a mutation operator (a basic differential evolution operator). In constrained multi-objective optimization problems, the MOEA/UE implements a new constraint-handling strategy that pulls infeasible solutions into or nearby the feasible domain. Experimental results illustrate that MOEA/UE obtains wider and more uniform Pareto-optimal fronts and better Pareto-optimal solutions. (c) 2020 Elsevier B.V. All rights reserved.
Keyword:
Multi-objective optimization
Linear programs
Local search
Differential evolution
Pareto-optimal solutions
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Trajectory planning for autonomous mobile robot using a hybrid improved QPSO algorithm
SOFT COMPUTING
IF2.5
The Psychological Effects and Benefits of Using Green Spaces in the City: A Field Experiment with Young Polish Adults
Forests
IF0

