ERFORMANCE EVALUATION OF A CONTINUOUS SIMULATED ANNEALING METHOD RELATIVE TO PURE RANDOM SEARCH ON GLOBAL OPTIMIZATION PROBLEMS

Simulated annealing is a relatively new technique for solving global optimization problems. The Hide & Seek method is an extension of the basic technique to the continuous domain in an adaptive and efficient manner. It also does not impose conditions such as differentiability or continuity on the function being optimized. This paper describes the Hide & Seek techniqueand appliesittotwo standard mathematical problemsin global optimization.The same problems are also solved using Pure Random Search and a careful comparison of the performance of the two methods is made.Results indicate that the Hide & Seek algorithm is a strong candidate for consideration in solving global optimization methods with a few variables. &nbsp