 | James A. Momoh - Technology & Engineering - 2000 - 498 pages
...would have been useful are never tried. But if it is too high, there will be many random populations, the offspring will start losing their resemblance...the ability to learn from the history of the search. Genetic algorithms differ from conventional optimization and search procedures in several fundamental... | |
 | Jia-Shen G. Hong, M. J. Lancaster - Technology & Engineering - 2004 - 488 pages
...designable parameters from the final population => <5 FIGURE 9.13 Basic genetic algorithm for optimization. much random perturbation, the offspring will start...the ability to learn from the history of the search. Usually the relation Nm < Ns < Np is held. 9.3.6 Optimization Strategies involving EM simulations 9.3.6.... | |
| |
If it is too low, many genes that would have been useful are never tried out; but if it is too high, there will be much random perturbation, the offspring will start losing their resemblance to the parents, and the algorithm will lose the ability to learn... 