A Numerical Comparison of Some Modified Controlled Random Search Algorithms

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 searchtype methods. Also a classification of the CRS algorithms is made based onglobal technique – local technique and the relative performance ofclasses is numerically explored.