.png){kind=icon}
Return
Computing budget allocation in multi-objective evolutionary algorithms for stochastic problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.swevo.2017.08.004.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multi-objective stochastic problems are important problems in practice and are often solved through multi objective evolutionary algorithms. Researchers have developed different noise handling techniques to improve the efficiency and accuracy of such algorithms, primarily by integrating these methods into the evaluation or environmental selection steps of the algorithms. In this work, a combination of studies that compare integration of different computing budget allocation methods into either the evaluation or the environmental selection steps are conducted. These comparisons are performed on stochastic problems derived from benchmark multi objective optimization problems and consider varying levels of noise. The algorithms are compared in terms of both proximity to and coverage of the true Pareto-optimal front and sufficient studies are performed to allow statistically significant conclusions to be drawn. It is shown that integrating computing budget allocation methods into the environmental selection step is better than integration within the evaluation step.
Keywords:
Computational complexity
Evolutionary computation
Gaussian noise
Genetic algorithms
Pareto analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.5
Papers:
2.2K
Citations:
1.0W
Organization
Cited Papers
Synthesis and Binding-analysis of 5E-[19-(2-bromoacetoxy)methyl]25-hydroxyvitamin D3 and 5E-25-hydroxyvitamin D3-19-methyl[(4-azido-2-nitro)phenyl]glycinate: Novel C19-modified Affinity and Photoaffinity Analogs of 25-hydroxyvitamin D3.png)
SteroidsOAAI
SteroidsIF0
OAAIShareSaveShareSaveShareSave
View more