An introduction to genetic algorithms

  • Authors:

  • Scott M. Thede

  • Affiliations:

  • DePauw University, Greencastle, IN

  • Venue:
  • Journal of Computing Sciences in Colleges
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

A genetic algorithm is one of a class of algorithms that searches a solution space for the optimal solution to a problem. This search is done in a fashion that mimics the operation of evolution - a "population" of possible solutions is formed, and new solutions are formed by "breeding" the best solutions from the population's members to form a new generation. The population evolves for many generations; when the algorithm finishes the best solution is returned. Genetic algorithms are particularly useful for problems where it is extremely difficult or impossible to get an exact solution, or for difficult problems where an exact solution may not be required. They offer an interesting alternative to the typical algorithmic solution methods, and are highly customizable, which make them an interesting challenge for students.