Abstract
The deficiencies of keeping population diversity, prematurity and low success rate of searching the global optimal solution are the shortcomings of genetic algorithm (GA). Based on the bias of samples in the uniform design sampling (UDS) point set, the crossover operation in GA is redesigned. Using the concentrations of antibodies in artificial immune system (AIS), the chromosomes concentration in GA is defined and the clonal selection strategy is designed. In order to solve the maximum clique problem (MCP), an new immune GA (UIGA) is presented based on the clonal selection strategy and UDS. The simulation results show that the UIGA provides superior solution quality, convergence rate, and other various indices to those of the simple and good point GA when solving MCPs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
El Akadi A, Amine A et al (2011) A two-stage gene selection scheme utilizing MRMR filter and GA wrapper. Knowl Inf Syst 26(3): 487–500
Zhang L, Zhang B (2000) Research on the mechanism of genetic algorithms. J Softw (Chinese) 11(7): 945–952
Hua L, Wang Y (1978) Applications of number-theoretic methods in approximate analysis (Chinese). Science Press, Beijing
Zhang L, Zhang B (2001) Good point set based genetic algorithm. Chin J Comput (Chinese) 24(9): 917–922
Zhang R-C, Wang Z-J (1996) Uniform design sampling and its fine properties (Chinese). Chin J Appl Probab Stat 12(4): 337–347
Gong M, Jiao L et al (2010) Immune algorithm with orthogonal design based initialization, cloning, and selection for global optimization. Knowl Inf Syst 25: 523–549
Stepney S et al (2005) Conceptual frameworks for artificial immune systems. Int J Unconv Comput 1(3): 315–338
Li Z, Cheng J (2007) Immune good-point set genetic algorithm. Comput Eng Appl (Chinese) 43(28): 37–40
Singh A, Gupta AK (2006) A hybrid heuristic for the maximum clique problem. J Heuristics 12(1–2): 5–22
Pullan W, Hoos HH (2006) Dynamic local search for the maximum clique problem. J Artif Intell Res 25: 159–185
Balas E, Niehaus W (1998) Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems. J Heuristics 4(2): 107–122
ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmarks/clique/ [EB/OL] 20/3/2011
Bin J (2008) Basic research on artificial immune algorithm and its application (chinese). Central South University, Changsha
De Jong KA (1975) An analysis of the behavior of a class of genetic adaptive systems. University of Michigan, Ann Arbor
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhou, BD., Yao, HL., Shi, MH. et al. An new immune genetic algorithm based on uniform design sampling. Knowl Inf Syst 31, 389–403 (2012). https://doi.org/10.1007/s10115-011-0476-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10115-011-0476-3