Hybrid Taguchi-genetic algorithm for global numerical optimization

In this paper, a hybrid Taguchi-genetic algorithm (HTGA) is proposed to solve global numerical optimization problems with continuous variables. The HTGA combines the traditional genetic algorithm (TGA), which has a powerful global exploration capability, with the Taguchi method, which can exploit the optimum offspring. The Taguchi method is inserted between crossover and mutation operations of a TGA. Then, the systematic reasoning ability of the Taguchi method is incorporated in the crossover operations to select the better genes to achieve crossover, and consequently, enhance the genetic algorithm. Therefore, the HTGA can be more robust, statistically sound, and quickly convergent. The proposed HTGA is effectively applied to solve 15 benchmark problems of global optimization with 30 or 100 dimensions and very large numbers of local minima. The computational experiments show that the proposed HTGA not only can find optimal or close-to-optimal solutions but also can obtain both better and more robust results than the existing algorithm reported recently in the literature.

[1]  Jyh-Horng Chou,et al.  Optimal Takagi-Sugeno Fuzzy Gain-Scheduler Design Using Taguchi-MHGA Method , 2001 .

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

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

[4]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[5]  Flavio S. Fogliatto,et al.  Robust design and analysis for quality engineering , 1997 .

[6]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Madhan Shridhar Phadke,et al.  Quality Engineering Using Robust Design , 1989 .

[8]  John Yen,et al.  A simplex genetic algorithm hybrid , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

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

[10]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[11]  Suat Tanaydin.  Robust Design and Analysis for Quality Engineering , 1996 .

[12]  T. R. Bement,et al.  Taguchi techniques for quality engineering , 1995 .

[13]  Jyh-Horng Chou,et al.  Application of the Taguchi-genetic method to design an optimal grey-fuzzy controller of a constant turning force system , 2000 .

[14]  P. Angelov.  Supplementary Crossover Operator for Genetic Algorithms based on the Center-of-Gravity Paradigm , 2001 .

[15]  Jean-Michel Renders,et al.  Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[16]  Dai Xiao.  An Improved Algorithm of Pattern Extraction Based Mutation Approach to Genetic Algorithm , 2002 .

[17]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[18]  Yuping Wang,et al.  An orthogonal genetic algorithm with quantization for global numerical optimization , 2001, IEEE Trans. Evol. Comput..

[19]  Lawrence Davis,et al.  Adapting Operator Probabilities in Genetic Algorithms , 1989, ICGA.

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