Affiliation:
1. Department of Computer Science University of Illinois at Urbana/Champaign Urbana, IL 61801
2. Department of General Engineering University of Illinois at Urbana/Champaign Urbana, IL 61801
Abstract
This paper analyzes the effect of noise on different selection mechanisms for genetic algorithms (GAs). Models for several selection schemes are developed that successfully predict the convergence characteristics of GAs within noisy environments. The selection schemes modeled in this paper include proportionate selection, tournament selection, (μ, λ) selection, and linear ranking selection. An allele-wise model for convergence in the presence of noise is developed for the OneMax domain, and then extended to more complex domains where the building blocks are uniformly scaled. These models are shown to accurately predict the convergence rate of GAs for a wide range of noise levels.
Subject
Computational Mathematics
Cited by
206 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献