.png){kind=icon}
返回
Evolutionary Algorithms for Minimax Problems in Robust Design
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2008.2004422.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many robust design problems can be described by minimax optimization problems. Classical techniques for solving these problems have typically been limited to a discrete form of the problem. More recently, evolutionary algorithms, particularly coevolutionary optimization techniques, have been applied to minimax problems. A new method of solving minimax optimization problems using evolutionary algorithms is proposed. The performance of this algorithm is shown to compare favorably with the existing methods on test problems. The performance of the algorithm is demonstrated on a robust pole placement problem and a ship engineering plant design problem.
Keyword:
Coevolution
evolutionary algorithms
minimax optimization
robust design
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
分享收藏Effect of N and P nutrition on extracellular secretion of lumichrome, riboflavin and indole acetic acid by N2-fixing bacteria and endophytes isolated from Psoralea nodules.png)
Symbiosis
SymbiosisIF0
PREAI
分享收藏分享收藏
查看更多内容