.png){kind=icon}
返回
Game Theory Based Evolutionary Algorithms: A Review with Nash Applications in Structural Engineering Optimization Problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s11831-016-9187-y.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A general review of game-theory based evolutionary algorithms (EAs) is presented in this study. Nash equilibrium, Stackelberg game and Pareto optimality are considered, as game-theoretical basis of the evolutionary algorithm design, and also, as problems solved by evolutionary computation. Applications of game-theory based EAs in computational engineering are listed, with special emphasis in structural optimization and, particularly, in skeletal structures. Additionally, a set of three problems are solved: reconstruction inverse problem, fully stressed design problem and minimum constrained weight, for discrete sizing of frame skeletal structures. We compare panmictic EAs, Nash EAs using 4 different static domain decompositions, including also a new dynamic domain decomposition. Two frame structural test cases of 55 member size and 105 member size are evaluated with the linear stiffness matrix method. Numerical experiments show the efficiency of the Nash EAs approach, confirmed with statistical significance analysis of results, and enhanced with the dynamic domain decomposition.
Keyword:
MULTIDISCIPLINARY DESIGN OPTIMIZATION
MULTIOBJECTIVE GENETIC ALGORITHM
FRAME STRUCTURES
INVERSE PROBLEMS
DISTRIBUTED OPTIMIZATION
TOPOLOGY OPTIMIZATION
MULTIPLE FOLLOWERS
STRATEGIES
SEARCH
EQUILIBRIUM
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12.1
论文数:
1.8K
被引数:
1.2W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏
查看更多内容