.png){kind=icon}
返回
A direct stochastic algorithm for global search
.png){kind=icon}
OA
AI
DOI：10.1016/S0096-3003(02)00629-X.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new algorithm called probabilistic global search lausanne (PGSL). PGSL is founded on the assumption that Optimal solutions can be identified through focusing search around sets of good solutions. Tests on benchmark problems having multi-parameter non-linear objective functions revealed that PGSL performs better than genetic algorithms and advanced algorithms for simulated annealing in 19 out of 23 cases studied. Furthermore as problem sizes increase, PGSL performs increasingly better than these other approaches. Empirical evidence of the convergence of PGSL is provided through its application to Lennard-Jones cluster optimisation problem. Finally, PGSL has already proved to be valuable for engineering tasks in areas of design, diagnosis and control. (C) 2002 Elsevier Inc. All rights reserved.
Keyword:
global optimisation
stochastic search
random search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
Investigation of morphologies and characterization of rare earth metal samarium hexacyanoferrate and its composite with surfactant intercalated graphene oxide for sensor applications.png)
RSC Adv.
RSC Adv.IF0
PREAI
分享收藏
查看更多内容