title: The crowding approach to niching in genetic algorithms.
abstract: A wide range of niching techniques have been investigated in evolutionary and genetic algorithms. In this article, we focus on niching using crowding techniques in the context of what we call local tournament algorithms. In addition to deterministic and probabilistic crowding, the family of local tournament algorithms includes the Metropolis algorithm, simulated annealing, restricted tournament selection, and parallel recombinative simulated annealing. We describe an algorithmic and analytical framework which is applicable to a wide range of crowding algorithms. As an example of utilizing this framework, we present and analyze the probabilistic crowding niching algorithm. Like the closely related deterministic crowding approach, probabilistic crowding is fast, simple, and requires no parameters beyond those of classical genetic algorithms. In probabilistic crowding, subpopulations are maintained reliably, and we show that it is possible to analyze and predict how this maintenance takes place. We also provide novel results for deterministic crowding, show how different crowding replacement rules can be combined in portfolios, and discuss population sizing. Our analysis is backed up by experiments that further increase the understanding of probabilistic crowding.
authors.affiliation: RIACS, NASA Ames Research Center, Mail Stop 269-3, Moffett Field, CA 94035, USA. omengshoel@riacs.edu
authors.forename: Ole J
authors.initials: OJ
authors.lastname: Mengshoel
authors.forename: David E
authors.initials: DE
authors.lastname: Goldberg
mesh_terms: D000465:Algorithms; D005823:Genetics; D008390:Markov Chains; D011336:Probability