arrow
返回

Computing budget allocation in multi-objective evolutionary algorithms for stochastic problems

delete2018-02-01
delete3
delete
OA
AI
M
Mengmei Liu *
A
Aaron M. Cramer
DOI:10.1016/j.swevo.2017.08.004delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

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.
Keyword:
Computational complexity
Evolutionary computation
Gaussian noise
Genetic algorithms
Pareto analysis
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Swarm and Evolutionary Computation 封面图
Swarm and Evolutionary Computation
IF:
8.5
论文数:
2.2K
被引数:
1.0W

机构

U
University of Kentucky
学者数:
2.5W
论文数: 2.1W
被引数: 41
引用论文

引用论文

err分享
err收藏
学者 查看更多内容