The term algorithm (pronounced "AL-go-rith-um") is a procedure or formula for solving a problem. The word derives from the name of the Arab mathematician, Al-Khowarizmi (825 AD). A computer program can be viewed as an elaborate algorithm. In mathematics and computer science, an algorithm usually means a small procedure that solves a recurrent problem.

Genetic algorithms are computerized search techniques based on the principles of natural genetics. Genetic algorithms begin with a population of encoded individuals. The individual, commonly referred to as a chromosome or string, is a computer compatible representation of a function or problem. Successive populations are created by applying genetic operators. The primary operators involved in the genetic algorithm process are:

Selection

Selection is the process of choosing individuals from the genetic population which have high fitness values. Typical selection methods include roulette and tournament.

Recombination

Recombination forms new individuals by generating copies of high-fitness individuals. A recombination technique, commonly known as crossover, creates new individuals by taking sub strings from two individuals to form an offspring. A crossover point, usually selected randomly, is used to determine the point within the string
for exchanging information from selected individuals.

Mutation

Mutation is the process of randomly changing encoded bit information for a newly created population individual. Mutation is known as an insurance policy to maintain search diversity within the population. Typically, mutation is performed with a small frequency of occurrence.

Click the link below to go to the next page

Next Page