Research of Alloy Orb on a New Immune Genetic Algorithm

Abstract:

The standard Genetic Algorithm has several limitations when dealing with dynamic environments. The most harmful limitation as to do with the tendency for the large majority of the members of a population to convergence prematurely to a particular region of the search space, making thus difficult for the GA to find other solutions when changes in the environment occur. In order to avoid the premature convergence and the slow search efficiency at posterior evolutionary process of the traditional immune genetic algorithm, a new immune genetic algorithm is proposed. This algorithm uses orthogonal crossover to generate initial population and uses elitist-crossover to increase the good patterns of the population and uses hybrid mutation to increase the ability of local and global optimization. It has shown fascinating results when being used in the optimization of multimodal function.

• Periodical: Advanced Materials Research (Volume 710)
• Pages: 735-738
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.710.735
• Online since: June 2013
• Authors: Shu Zhang
• Keywords: B-Cells, Genetic Algorithm (GA), Hypermutation, Immune, Orthogonal Crossover

References

[1] Mi,H.X. , master's thesis, Computational Mathematics, Northwestern University, 2009.

[2] Li, W., Proceedings of the United States Department of Energy Cyber Security Group 2004 Training Conference, May 2004, pp.24-27.

[3] Lamees Alhazzaa, King Saud University Computer Science Collage CSC590_Selected Topic, 2002 .

[4] Gary Stein, ACM Southeast Regional Conference Proceedings of the 43rd annual Southeast regional conference - Volume 2, 2005, pp.136-141.

[5] Andrew P. Bradley , Proc. VIIth Digital Image Computing: Techniques and Applications, Sun C., Talbot H., Ourselin S. and Adriaansen T. (Eds.), 2003, pp.29-38.

DOI: 10.1071/9780643090989

[6] Wang, A. T., master's thesis, Communication and Information System, Ocean University of China, 2008.