说明：  A general class of search algorithms, na-andoomhewirtic search, is reviewed, and it is indicated how a variety of generational style GASare special cases of it. Abstractly, the message of this paper is summarized by this statement: Let Y' be a normal, ergodic, large population instance of random heuristic search. If the minimum cost tributary of ij is unique