Information Engineering School, University of Science and Technology Beijing, Beijing 100083, China
Department of Information and Control Engineering, Southwest Institute of Technology, Mianyang 621002, China
中文摘要
In order to solve the problem between searching performance and convergence of genetic algorithms, a fast genetic algorithm generalized self-adaptive genetic algorithm (GSAGA) is presented. (1) Evenly distributed initial population is generated. (2) Superior individuals are not broken because of crossover and mutation operation for they are sent to subgeneration directly. (3) High quality immigrants are introduced according to the condition of the population schema. (4) Crossover and mutation are operated on self-adaptation. Therefore, GSAGA solves the coordination problem between convergence and searching performance. In GSAGA, the searching performance and global convergence are greatly improved compared with many existing genetic algorithms. Through simulation, the validity of this modified genetic algorithm is proved.
In order to solve the problem between searching performance and convergence of genetic algorithms, a fast genetic algorithm generalized self-adaptive genetic algorithm (GSAGA) is presented. (1) Evenly distributed initial population is generated. (2) Superior individuals are not broken because of crossover and mutation operation for they are sent to subgeneration directly. (3) High quality immigrants are introduced according to the condition of the population schema. (4) Crossover and mutation are operated on self-adaptation. Therefore, GSAGA solves the coordination problem between convergence and searching performance. In GSAGA, the searching performance and global convergence are greatly improved compared with many existing genetic algorithms. Through simulation, the validity of this modified genetic algorithm is proved.
下载: