Application of Latin Hypercube Sampling in the Immune Genetic Algorithm for Solving the Maximum Clique Problem

摘要

Based on Latin Hypercube Sampling method, the crossover operation in GA is redesigned; combined with immune mechanism, chromosome concentration is defined and clonal selection strategy is designed, thus an Immune Genetic Algorithm is given based on Latin Hypercube Sampling for solving the Maximum Clique Problem in this paper. The examples shows the new algorithm in solution quality, convergence speed, and other indicators is better than the classical genetic algorithm and good point set genetic algorithm. On the other hand, the new algorithm is not inferior to such classical algorithms as dynamic local search, and it got better solutions to some examples.