Research on Social Talent Governance Based on Genetic Algorithm

Abstract

The existing social talent governance algorithms have a number of issues such as slow convergence rate, relatively low data accuracy, recall rate, and low anti-interference. To address these problems, this paper proposes a research on social talent governance algorithm based on genetic algorithm. We discuss the difference between the traditional and the genetic algorithms and determine the implementation process of genetic algorithm. On this basis, the excellent individuals are determined by independent computing fitness, and the initialization population is designed according to the individual similarity threshold. After the population is defined, the roulette and deterministic sampling selection method are integrated to clarify the selection calculation process. Based on the calculation results, we design the crossover operator by segmented single-point crossover between individuals. The mutation operator is designed by segmented mutation of different gene segments according to the calculation results. The results are incorporated into the simulated annealing acceptance probability to conduct simulated annealing for the individuals after the cross-mutation operation and set relevant conditions after the end of the algorithm. We seek the optimal solution of the data within the number of iterations and finally realize the whole process of social talent governance algorithm. The experimental results show that the proposed algorithm has fast convergence rate, high data precision and recall, and has certain feasibility.