COMPARISONS BETWEEN THE HYBRID TAGUCHI-GENETIC ALGORITHM AND GENETIC ALGORITHM
Koun-Tem Sun1, Ching-Ling Lin1, Hsin-Te Chan1, HongMing Kang1, Man-Ting Ku2
1National University of Tainan
2Far East University
This is an open access article distributed under the Creative Commons Attribution License CC BY 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited
Hybrid Taguchi genetic algorithm can be used to solve the global continuous optimization problems. Aside from the global search capability of traditional genetic algorithm, it further combines Taguchi experimental method to explore the optimal feasibility of the offspring. Taguchi method is inserted between the crossover and mutation operations of the traditional genetic algorithm. Hybrid Taguchi genetic algorithm also seems to outperform the traditional genetic method in obtaining the optional or near optimal solutions because of its fast convergence ability and robustness. Although the hybrid Taguchi genetic algorithm is more powerful than the traditional genetic one in the optimization of global continuous function, yet it still needs further investigation to conclude if it also offers better solution than the latter to the optimization of global discrete function.
Therefore, this study tries to compare the two algorithms in each individual’s performance in the optimization of global discrete function. It aims to figure out whether the hybrid Taguchi genetic algorithm is better than traditional genetic algorithm or not.
Hybrid Taguchi-Genetic algorithm, Genetic algorithm, Optimization problems.