On global rapid optimum seeking of GAs
遗传算法的全局快速寻优

Global rapid optimum seeking of GAs is analyzed in this paper. It is pointed out that in order to make a guaranteed global search, the population of the first t generations (PFtG) should contain at least one same-defining-position-unlapped-exhaustive (SDPUE) set. It is also pointed out that an SDPUE set whose schemata are disparity in average fitness should be included in the PFtG before the searching space can be reduced, and the lower the order of these schemata is, the earlier the search-space reduction begins.