Replacement strategies to preserve useful diversity in steady-state genetic algorithms

  • Authors:
  • Manuel Lozano;Francisco Herrera;José Ramón Cano

  • Affiliations:
  • Department of Computer Science and Artificial Intelligence, University of Granada, 18071 Granada, Spain;Department of Computer Science and Artificial Intelligence, University of Granada, 18071 Granada, Spain;Department of Electronic Engineering, Computer Systems and Automatics, Escuela Superior de La Rábida, University of Huelva, 21819 Huelva, Spain

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2008

Quantified Score

Hi-index 0.07

Visualization

Abstract

In this paper, we propose a replacement strategy for steady-state genetic algorithms that considers two features of the candidate chromosome to be included into the population: a measure of the contribution of diversity to the population and the fitness function. In particular, the proposal tries to replace an individual in the population with worse values for these two features. In this way, the diversity of the population becomes increased and the quality of the solutions gets better, thus preserving high levels of useful diversity. Experimental results show the proposed replacement strategy achieved significant performance for problems with different difficulties, with regards to other replacement strategies presented in the literature.