.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
global optimisation
stochastic search
random search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
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
ShareSaveShareSaveShareSaveShareSave
View more