Modified random-to-pattern search algorithm (mrps) for global ptimization

B. N. Rajani, B. S. N. Murty, P.J. Reddy · International Journal of Computer Mathematics · 1992

An improved computer code, MRPS, for solving global optimization problems is presented. In this code, the salient features of random-to-pattern search algorithm proposed by Heydweiller et al. [6] and controlled random search algorithm (CRS2) of Price [13] are suitably incorporated. The performance of MRPS was tested with nine constrained problems, reported in the literature. The results obtained clearly indicate the efficiency and reliability of the proposed code in achieving the global optimum.

Read the paper · More papers on PaperTik