.png){kind=icon}
.png){kind=icon}
Return
An adaptive interval many-objective evolutionary algorithm with information entropy dominance
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2024.101749.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Interval many-objective optimization problems (IMaOPs) involve more than three conflicting objectives with interval parameters. Various real-world applications under uncertainty can be modeled as IMaOPs to solve, so effectively handling IMaOPs is crucial for solving practical problems. This paper proposes an adaptive interval many-objective evolutionary algorithm with information entropy dominance (IMEA-IED) to tackle IMaOPs. Firstly, an interval dominance method based on information entropy is proposed to adaptively compare intervals. This method constructs convergence entropy and uncertainty entropy related to interval features and innovatively introduces the idea of using global information to regulate the direction of local interval comparison. Corresponding interval confidence levels are designed for different directions. Additionally, a novel niche strategy is designed through interval population partitioning. This strategy introduces a crowding distance increment for improved subpopulation comparison and employs an updated reference vector method to adjust the search regions for empty subpopulations. The IMEA-IED is compared with seven interval optimization algorithms on 60 interval test problems and a practical application. Empirical results affirm the superior performance of our proposed algorithm in tackling IMaOPs.
Keywords:
Evolutionary algorithm
Interval uncertainty
Interval dominance method
Information entropy
Many-objective optimization problem
Niche selection strategy
Journal
IF:
8.5
Papers:
2.2K
Citations:
1.0W
Organization
View more organizations