A general global or near global optimization method - self-adaptive heuristic evolutionary programming

Based on the combination of the general evolutionary programming and the random search technique, this paper develops a self-adaptive mutation operator and presents a new algorithm, called the self-adaptive evolutionary programming. The algorithm includes two important aspects: 1) a new modal of mutation which reflects the principle of organic evolution in nature; and 2) the mutation operator is self-adaptive during the optimization. The new method is tested on some mathematical functions, and numerical results demonstrate the strong self-adaptability and versatility of the new algorithm.