An evolutionary programming algorithm for continuous global optimization

Evolutionary computations are very effective at performing global search (in probability), however, the speed of convergence could be slow. This paper presents an evolutionary programming algorithm combined with macro-mutation (MM), local linear bisection search (LBS) and crossover operators for global optimization. The MM operator is designed to explore the whole search space and the LBS operator to exploit the neighborhood of the solution. Simulated annealing is adopted to prevent premature convergence. The performance of the proposed algorithm is assessed by numerical experiments on 12 benchmark problems. Combined with MM, the effectiveness of various local search operators is also studied.

[1]  Jennifer S. Haase,et al.  Application of Evolutionary Programming to Earthquake Hypocenter Determination , 1995, Evolutionary Programming.

[2]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[3]  Robert G. Reynolds,et al.  Proceedings of the 6th International Conference on Evolutionary Programming VI , 1997 .

[4]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[5]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[6]  David B. Fogel,et al.  Evolving artificial intelligence , 1992 .

[7]  Roger J.-B. Wets,et al.  Minimization by Random Search Techniques , 1981, Math. Oper. Res..

[8]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[9]  Kumar Chellapilla,et al.  Combining mutation operators in evolutionary programming , 1998, IEEE Trans. Evol. Comput..

[10]  Roger Fletcher,et al.  A Rapidly Convergent Descent Method for Minimization , 1963, Comput. J..

[11]  John H. Holland,et al.  Outline for a Logical Theory of Adaptive Systems , 1962, JACM.

[12]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[13]  W. Hart.  Adaptive global optimization with local search , 1994 .

[14]  David B. Fogel,et al.  Two new mutation operators for enhanced search and optimization in evolutionary programming , 1997, Optics & Photonics.

[15]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[16]  David B. Fogel,et al.  Evolutionary Computation: Towards a New Philosophy of Machine Intelligence , 1995 .

[17]  Xin Yao,et al.  Fast Evolution Strategies , 1997, Evolutionary Programming.

[18]  Xin Yao,et al.  Fast Evolutionary Programming , 1996, Evolutionary Programming.

[19]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[20]  Se-Young Oh,et al.  A new mutation rule for evolutionary programming motivated from backpropagation learning , 2000, IEEE Trans. Evol. Comput..

[21]  Chee Kiong Soh,et al.  EVOLUTIONARY PROGRAMMING FOR INVERSE PROBLEMS IN CIVIL ENGINEERING , 2001 .