Survey: A survey of repair methods used as constraint handling techniques in evolutionary algorithms

  • Authors:
  • Sancho Salcedo-Sanz

  • Affiliations:
  • Department of Signal Theory and Communications, Universidad de Alcalá, Madrid, Spain

  • Venue:
  • Computer Science Review
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper provides a survey of the most important repair heuristics used in evolutionary algorithms to solve constrained optimization problems. Popular techniques are reviewed, such as some crossover operators in permutation encoding, algorithms for fixing the number of 1s in binary encoded genetic algorithms, and more specialized techniques such as Hopfield neural networks, heuristics for graphs and trees, and repair heuristics in grouping genetic algorithms. The survey also gives some indications about the design and implementation of hybrid evolutionary algorithms, and provides a revision of the most important applications in which hybrid evolutionary techniques have been used.