Abstract: In this paper, a new algorithm is proposed for the nonlinear programming problems, The algorithm applied the simulated annealing to the CRS algorithm, According to the simulated annealing reflects on concentrates and proliferates in each iteration, Enables the CRS algorithm to search the global optimization more easier rather than the local optimization. Finally, the proposed algorithm is applied to two typical function optimization problems, and the numerical results illustrate the accuracy and efficiency of the algorithm.

Key words: CRS algorithm, simulated annealing, global optimization,
accept probability