Skip to main content
Article
Probabilistic Crowding: Deterministic Crowding with Probabilistic Replacement
Proc. of the Genetic and Evolutionary Computation Conference (GECCO-99) (1999)
  • Ole J Mengshoel, Carnegie Mellon University
  • David E Goldberg
Abstract

This paper presents a novel niching algorithm, probabilistic crowding. Like its predecessor deterministic crowding, probabilistic crowding is fast, simple, and requires no parameters beyond that of the classical GA. In probabilistic crowding, subpopulations are maintained reliably, and we analyze and predict how this maintenance takes place.

This paper also identifies probabilistic crowding as a member of a family of algorithms, which we call integrated tournament algorithms. Integrated tournament algorithms also include deterministic crowding, restricted tournament selection, elitist recombination, parallel recombinative simulated annealing, the Metropolis algorithm, and simulated annealing.

Keywords
  • Probabilistic crowding,
  • deterministic crowding,
  • niching rule
Publication Date
July, 1999
Citation Information
Ole J Mengshoel and David E Goldberg. "Probabilistic Crowding: Deterministic Crowding with Probabilistic Replacement" Proc. of the Genetic and Evolutionary Computation Conference (GECCO-99) (1999)
Available at: http://works.bepress.com/ole_mengshoel/14/