.png){kind=icon}
返回
Genetically controlled random search: a global optimization method for continuous multidimensional functions
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cpc.2005.09.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new stochastic method for locating the global mini mum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use of the procedure known as grammatical evolution. The method can be considered as a genetic modification of the Controlled Random Search procedure due to Price. The user may code the objective function either in C++ or in Fortran 77. We offer a comparison of the new method with others of similar structure, by presenting results of computational experiments on a set of test functions.
Keyword:
global optimization
stochastic methods
genetic programming
grammatical evolution
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
1.2W
被引数:
3.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏分享收藏
查看更多内容