Genetic algorithms with noisy fitness

Authors:
W. Zhai;P. Kelly;W. -B. Gong
Affiliations:
Department of Electrical and Computer Engineering University of Massachusetts, Amherst, MA 01003, U.S.A.;Department of Electrical and Computer Engineering University of Massachusetts, Amherst, MA 01003, U.S.A.;Department of Electrical and Computer Engineering University of Massachusetts, Amherst, MA 01003, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1996

Citing 2
Cited 0

Genetic Algorithms in Noisy Environments

Machine Learning
Genetic Search with Approximate Function Evaluation

Proceedings of the 1st International Conference on Genetic Algorithms

Quantified Score

Hi-index	0.98

Visualization

Abstract

The convergence properties of genetic algorithms with noisy fitness information are studied here. In the proposed scheme, hypothesis testing methods are used to compare sample fitness values. The ''best'' individual of each generation is kept and a greater-than-zero mutation rate is used so that every individual will be generated with positive probability in each generation. The convergence criterion is different from the frequently-used uniform population criterion; instead, the sequence of the ''best'' individual in each generation is considered, and the algorithm is regarded as convergent if the sequence of the ''best'' individuals converges with probability one to a point with optimal average fitness.