.png){kind=icon}
.png){kind=icon}
Return
An objective reduction algorithm using representative Pareto solution search for many-objective optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-015-1776-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In recent years, many-objective optimization problems (i.e. more than three objectives) have attracted the interests of many researchers. The main difficulties of many-objective optimization problems lie in high computational cost, stagnation in search process, etc. It is almost impossible to design an algorithm effective for all problems. However, for some problems, especially for problems with redundant objectives, it is possible to design effective algorithms by removing the redundant objectives and keeping the non-redundant objectives so that the original problem becomes the one with much fewer objectives. To do so, first, a multi-objective evolutionary algorithm-based decomposition is adopted to generate a smaller number of representative non-dominated solutions widely distributed on the Pareto front. Then the conflicting objective pairs are identified through these non-dominated solutions, and the redundant objectives are determined by these pairs and then removed. Based on these, a fast non-redundant objectives generation algorithm is proposed in this paper. Finally, the experiments are conducted on a set of benchmark test problems and the results indicate the effectiveness and efficiency of the proposed algorithm.
Keywords:
Many-objective optimization
Non-redundant objective set
Conflicting objectives
Objective reduction
Evolutionary algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.