关键词: 进化规划, 早熟收敛, 改进的随机搜索方法, 自调整

Abstract: Aiming at the weakness premature convergence and slow convergence velocity of evolutionary programming algorithm，combining the improved random search method with evolutionary programming，a self-adjusting evolutionary programming algorithm is proposed.In this algorithm，the mutation is carried out using the Gaussian mutation operator.Using the improved random search method to make the mutation of individual self-adjusting，enhance the individual capacity of evolution in the direction of high fitness，increase the diversity among individual differences，and then improve the performance of the algorithm.Simulations based on benchmarks confirm that this algorithm is better than classical evolutionary programming algorithm in the aspects of global optimization，convergence speed and the robustness.

Key words: evolutionary programming, premature convergence, improved random search method, self-adjusting