Solving 2-way graph partitioning problem using genetic algorithm based on uniform design sampling
均匀设计抽样混合遗传算法求解图的二划分问题

Genetic Algorithm (GA) is a guided random search and the guiding direction always aims at the family whose ancestors have schemata with high fitness. Based on the results, the crossover operation in GA was redesigned by using the principle of random uniform design sampling and combining the locale search strategy. Then a new GA called Genetic Algorithm based on Uniform Design Sampling (UDS) was presented. The new GA was applied to solve the 2-way graph partitioning problem. Compared to simple GA and good point GA for solving this problem, the simulation results show that the new GA has superiority in terms of speed and accuracy and overcomes premature convergence.