A population-based algorithm-generator for real-parameter optimization

In this paper, we propose a population-based, four-step, real-parameter optimization algorithm-generator. The approach divides the task of reaching near the optimum solution into four independent plans of (i) selecting good solutions from a solution base, (ii) generating new solutions using the selected solutions, (iii) choosing inferior or spurious solutions for replacement, and (iv) updating the solution base with good new or old solutions. Interestingly, many classical and evolutionary optimization algorithms are found to be representable by this algorithm-generator. The paper also recommends an efficient optimization algorithm with the possibility of using a number of different recombination plans and parameter values. With a systematic parametric study, the paper finally recommends a real-parameter optimization algorithm which outperforms a number of existing classical and evolutionary algorithms. To extend this study, the proposed algorithm-generator can be utilized to develop new and more efficient population-based optimization algorithms. The treatment of population-based classical and evolutionary optimization algorithms identically through the proposed algorithm-generator is the main hall-mark of this paper and should enable researchers from both classical and evolutionary fields to understand each other’s methods better and interact in a more coherent manner.

[1]  Kalyanmoy Deb,et al.  Optimization for Engineering Design: Algorithms and Examples , 2004 .

[2]  Kalyanmoy Deb,et al.  On self-adaptive features in real-parameter evolutionary algorithms , 2001, IEEE Trans. Evol. Comput..

[3]  M. J. Box.  A New Method of Constrained Optimization and a Comparison With Other Methods , 1965, Comput. J..

[4]  Hans-Paul Schwefel,et al.  Numerical optimization of computer models , 1981 .

[5]  S. Sorooshian,et al.  Shuffled complex evolution approach for effective and efficient global minimization , 1993 .

[6]  Tatsuya Nomura,et al.  Numerical Coding and Unfair Average Crossover in GA for Fuzzy Rule Extraction in Dynamic Environments , 1995, IEEE/Nagoya-University World Wisepersons Workshop.

[7]  Singiresu S. Rao,et al.  Optimization Theory and Applications , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[8]  Christopher R. Houck,et al.  On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[9]  Masayuki Yamamura,et al.  Theoretical Analysis of Simplex Crossover for Real-Coded Genetic Algorithms , 2000, PPSN.

[10]  Kalyanmoy Deb,et al.  A flexible optimization procedure for mechanical component design based on genetic adaptive search , 1998 .

[11]  David B. Fogel,et al.  An Evolutionary Programming Approach to Self-Adaptation on Finite State Machines , 1995, Evolutionary Programming.

[12]  Larry J. Eshelman,et al.  The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.

[13]  Georges R. Harik,et al.  Foundations of Genetic Algorithms , 1997 .

[14]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[15]  A. Ravindran,et al.  Engineering Optimization: Methods and Applications , 2006 .

[16]  Dirk Thierens,et al.  Toward a Better Understanding of Mixing in Genetic Algorithms , 1993 .

[17]  D. Fogel.  Evolutionary algorithms in theory and practice , 1997, Complex..

[18]  Hajime Kita,et al.  A Comparison Study of Self-Adaptation in Evolution Strategies and Real-Coded Genetic Algorithms , 2001, Evolutionary Computation.

[19]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

[20]  L. Darrell Whitley,et al.  Lamarckian Evolution, The Baldwin Effect and Function Optimization , 1994, PPSN.

[21]  Francisco Herrera,et al.  Fuzzy connectives based crossover operators to model genetic algorithms population diversity , 1997, Fuzzy Sets Syst..

[22]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[23]  Kalyanmoy Deb,et al.  A combined genetic adaptive search (GeneAS) for engineering design , 1996 .

[24]  M. Yamamura,et al.  Multi-parent recombination with simplex crossover in real coded genetic algorithms , 1999 .

[25]  Heinz Mühlenbein,et al.  Fuzzy Recombination for the Breeder Genetic Algorithm , 1995, ICGA.

[26]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[27]  Larry J. Eshelman.  The CHC Adaptive Search Algo-rithm , 1991 .

[28]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

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

[30]  David E. Goldberg,et al.  Real-coded Genetic Algorithms, Virtual Alphabets, and Blocking , 1991, Complex Syst..

[31]  Isao Ono,et al.  A Real Coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distributed Crossover , 1997, ICGA.

[32]  Shigenobu Kobayashi,et al.  Multi-Parental Extension of the Unimodal Normal Distribution Crossover for Real-Coded Genetic Algorithms , 2000 .

[33]  Alden H. Wright,et al.  Genetic Algorithms for Real Parameter Optimization , 1990, FOGA.

[34]  Hans-Georg Beyer,et al.  The Theory of Evolution Strategies , 2001, Natural Computing Series.

[35]  M. Yamamura,et al.  A functional specialization hypothesis for designing genetic algorithms , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[36]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.

[37]  W. Price.  Global optimization by controlled random search , 1983 .

[38]  Samuel H. Brooks.  A Discussion of Random Methods for Seeking Maxima , 1958 .

[39]  Alain Pétrowski,et al.  A clearing procedure as a niching method for genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[40]  George E. P. Box,et al.  Evolutionary Operation: a Method for Increasing Industrial Productivity , 1957 .

[41]  T. H. I. Jaakola,et al.  Optimization by direct search and systematic reduction of the size of search region , 1973 .

[42]  David E. Goldberg,et al.  Learning Linkage , 1996, FOGA.

[43]  Kalyanmoy Deb,et al.  Unveiling innovative design principles by means of multiple conflicting objectives , 2003 .

[44]  Kalyanmoy Deb,et al.  A Computationally Efficient Evolutionary Algorithm for Real-Parameter Optimization , 2002, Evolutionary Computation.

[45]  Hiroaki Satoh,et al.  Minimal generation gap model for GAs considering both exploration and exploitation , 1996 .

[46]  Zbigniew Michalewicz,et al.  Handling Constraints in Genetic Algorithms , 1991, ICGA.

[47]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[48]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[49]  Nikolaus Hansen,et al.  Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[50]  Dirk Thierens,et al.  Mixing in Genetic Algorithms , 1993, ICGA.

[51]  Kalyanmoy Deb,et al.  Self-Adaptive Genetic Algorithms with Simulated Binary Crossover , 2001, Evolutionary Computation.

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