Intelligent Control Systems and Optimization

Genetic Algorithms are heuristic search approaches that are applicable to a wide range of optimization problems. This flexibility makes them attractive for many optimization problems in practice. Evolution is the basis of Genetic Algorithms. It follows 3 rules and they are Selection rule, Cross over rule and Mutation Rule. Genetic operators change the solutions. Crossover operators combine the genomes of two or more solutions. Mutation adds randomness to solutions and should be scalable, drift-less, and reach each location in solution space. Genetic Algorithms are search based algorithms based on the concepts of natural selection and genetics. Genetic Algorithms are a subset of a much larger branch of computation known as Evolutionary Computation. Genetic algorithms optimize a given function by means of a random search. They are best suited for optimization and tuning problems in the cases where no prior information is available. As an optimization method genetic algorithm are much more effective than a random search. Genetic Algorithms are adaptive heuristic search algorithms that belong to the larger part of evolutionary algorithms. Genetic Algorithms  have demonstrated to be effective procedures for solving multicriterial optimization problems. It is a very popular meta-heuristic technique for solving optimization problems. These algorithms mimic models of natural evolution and can adaptively search large spaces in near-optimal ways. They are commonly used to generate high-quality solutions for optimisation problems and search problems.