Global optimization algorithms for a cad workstation
Journal of Optimization Theory and Applications
Global optimization and simulated annealing
Mathematical Programming: Series A and B
Efficient and portable combined Tausworthe random number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Application of stochastic global optimization algorithms to practical problems
Journal of Optimization Theory and Applications
Generating beta variates with nonintegral shape parameters
Communications of the ACM
Stochastic Global Optimization: Problem Classes and Solution Techniques
Journal of Global Optimization
Population set-based global optimization algorithms: some modifications and numerical studies
Computers and Operations Research
A Combined Global & Local Search (CGLS) Approach to Global Optimization
Journal of Global Optimization
Random search optimization approach for highly multi-modal nonlinear problems
Advances in Engineering Software
Hybrid differential evolution and the simplified quadratic interpolation for global optimization
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Random search optimization approach for highly multi-modal nonlinear problems
Advances in Engineering Software
A simulated annealing driven multi-start algorithm for bound constrained global optimization
Journal of Computational and Applied Mathematics
Retrospective illumination correction of retinal images
Journal of Biomedical Imaging
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
A benchmarking framework for simulation-based optimization of environmental models
Environmental Modelling & Software
Hi-index | 0.00 |
In this paper we propose a new version of the Controlled Random Search(CRS) algorithm of Price. The new algorithmhas been tested on thirteen global optimization test problems. Numericalexperiments indicate that the resulting algorithm performs considerablybetter than the earlier versions of the CRS algorithms. The algorithm,therefore, could offer a reasonable alternative to many currently availablestochastic algorithms, especially for problems requiring ’direct search‘type methods. Also a classification of the CRS algorithms is made based on’global technique‘ – ’local technique‘ and the relative performance ofclasses is numerically explored.