Journal of Global Optimization

, Volume 11, Issue 4, pp 377-385

First online:

A Numerical Comparison of Some Modified Controlled Random Search Algorithms

  • M. M. AliAffiliated withTurku Center for Computer Science (TUCS)
  • , A. TörnAffiliated withDepartment of Computer Science, Åbo Akademi University
  • , S. ViitanenAffiliated withDepartment of Computer Science, Åbo Akademi University

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.

Global optimization β-distribution controlled random search