| 摘要 |
<p>The present invention is a non-linear genetic algorithm for problem solving. The iterative process of the present invention operates on a population of problem solving entities. First, the activated entities perform, producing results. Then the results are assigned values and associated with the producing entity (1306). Next, entities having relatively high associated values are selected (1316). The selected entities perform either crossover (1320) or fitness proportionate reproduction (1330). In addition, other operations such as mutation (1350), permutation (1340) define building blocks and editing may be used. Lastly, the newly created entities are added (1360) to the population.</p> |
