Character match search using Genetic algorihms
In computer science and operations research , a genetic algorithm ( GA ) is a meta-heuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA). Genetic algorithms are commonly used to generate high-quality solutions to optimization and search problems by relying on bio-inspired operators such as mutation , crossover and selection . [1] John Holland introduced genetic algorithms in 1960 based on the concept of Darwin’s theory of evolution A.K.A Biological life ; afterwards, his student Goldberg extended GA in 1989 . One of the most popular application of the genetic algorithm was on the traveling salesman challenge; for some of you unfamiliar to the concept, The travelling salesman problem ( TSP ) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" It
