.png){kind=icon}
.png){kind=icon}
Return
An improved α-dominance strategy for many-objective optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-014-1570-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The convergence ability of Pareto-based evolutionary algorithms sharply reduces for many objective optimization problems because the solutions are difficult to rank by the Pareto dominance. To increase the selection pressure toward the global optimal solutions and well-maintain the diversity of obtained solutions, in this paper, an improved alpha-dominance strategy is proposed. The proposal assigns alpha values based on an elliptic function used to rank the solutions to enhance the convergence pressure, and it can also well maintain the diversity of obtained solutions through assigning different values of a for different solutions, i. e., the solutions whose objective vectors locate in the objective space are assigned a larger a. Experimental results show that the improved alpha-dominance strategy can guide the searching process to converge to the Pareto Front and maintain the diversity of obtained solutions for many-objective optimization problems.
Keywords:
Many-objective optimization
Ranking
alpha-Dominance strategy
Elliptic function
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.