Fitness distributions in evolutionary computation: analysis of noisy functions
暂无分享,去创建一个
Traditional techniques for designing evolutionary algorithms rely on schema processing, minimizing expected losses, and emphasize certain genetic operators such as crossover. Unfortunately, these have failed to provide robust optimization performance. Recently, fitness distribution analysis has been proposed as an alternative tool for designing efficient evolutionary computations. This analysis has concentrated on obtaining very accurate expected improvement (EI) and probability of improvement (PI) statistics for specific mutation operators (using as many as 5000 Monte Carlo trials) on noiseless object functions. In practice, such extensive analysis might be computationally prohibitive and the objective functions might also be noisy. Experiments were designed here to determine the amount of sampling required to obtain useful estimates of the EI and PI both in the presence and absence of noise. Simulations indicate that useful statistics can be obtained in as few as 10 trials in the absence of noise. On noisy functions, however, the required number of trials increased as the 'signal to noise ratio' decreased.
[1] D. Fogel. ASYMPTOTIC CONVERGENCE PROPERTIES OF GENETIC ALGORITHMS AND EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTS , 1994 .
[2] David B. Fogel,et al. Using fitness distributions to design more efficient evolutionary computations , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.
[3] David B. Fogel,et al. Evolutionary computation - toward a new philosophy of machine intelligence (3. ed.) , 1995 .