An Enhanced Genetic Algorithm with Orthogonal Design

This paper presents an enhanced Latin square genetic algorithm (LSGA). It makes the chromosomes to be more sensible to their surrounding regions. The algorithm applies orthogonal design method to every chromosome in the population to detect chromosomes with high fitness values in the surrounding regions. Orthogonal design method makes it more concise and direct to find the delegate to represent the situation of the surrounding regions. We execute the proposed algorithm to solve 15 test functions and compare it with traditional algorithm without using orthogonal design method. The results show that the proposed algorithm can find optimal or close-to-optimal solutions with higher speed and more accuracy.

[1]  Michael de la Maza,et al.  Book review: Genetic Algorithms + Data Structures = Evolution Programs by Zbigniew Michalewicz (Springer-Verlag, 1992) , 1993 .

[2]  Jun Zhang,et al.  NN-Based Damage Detection in Multilayer Composites , 2005, ICNC.

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

[4]  Jun Zhang,et al.  Adaptive crossover and mutation in genetic algorithms based on clustering technique , 2005, GECCO '05.

[5]  Yuping Wang,et al.  Multiobjective programming using uniform design and genetic algorithm , 2000, IEEE Trans. Syst. Man Cybern. Part C.

[6]  Lih-Yuan Deng,et al.  Orthogonal Arrays: Theory and Applications , 1999, Technometrics.

[7]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[8]  C. Ireland.  Fundamental concepts in the design of experiments , 1964 .

[9]  Jun Zhang,et al.  Implementation of an Ant Colony Optimization technique for job shop scheduling problem , 2006 .

[10]  Melvyn B. Nathanson,et al.  Elementary Methods in Number Theory , 1999 .

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

[12]  Lipo Wang,et al.  A noisy chaotic neural network for solving combinatorial optimization problems: stochastic chaotic simulated annealing , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[13]  Nidhal Rezg,et al.  Geometric approach and taboo search for scheduling flexible manufacturing systems , 2001, IEEE Trans. Robotics Autom..

[14]  K. Fang,et al.  Number-theoretic methods in statistics , 1993 .

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

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

[17]  Qingfu Zhang,et al.  An orthogonal genetic algorithm for multimedia multicast routing , 1999, IEEE Trans. Evol. Comput..

[18]  Jun Zhang,et al.  Implementation of a decoupled optimization technique for design of switching regulators using genetic algorithms , 2001 .

[19]  Lalit M. Patnaik,et al.  Genetic algorithms: a survey , 1994, Computer.