Genetic algorithms: Explanation of basic ideas (tutorial lecture part I) |
Nirupam Chakraborti |
Indian Institute of Technology, Kharagpur (IIT-KGP), kharagpur 721302, India |
Abstract |
The proposed tutorial on Genetic Algorithms is designed to provide the basic exposure in Genetic Algorithms to graduate students and practicing engineers at large. The lectures will be decomposed into three sessions, and the organization for this session will be as follows: Session 1 (The single objective approach) Evolutionary Computation and its historical perspective. The American and German schools of thought. Simple Genetic Algorithms and its major operators: Reproduction, Crossover, Mutation and their variants. Genetic Algorithms for obtaining a sequence Mathematical Construction of Genetic Operators. Schema Theorem of John Holland. Variants of Binary Encoded Genetic Algorithms: Micro Genetic Algorithm, Messy Genetic Algorithm, Greedy Genetic Algorithm etc. Hamming Cliffs. Real Coded Genetic Algorithms. Differential Evolution. Elements of Evolutionary Strategies. Uni-modal vs. Multi-modal problems in Genetic Algorithms. |