3 Credit Hour Course
Intended For Level 0 Term 0 Students
Prerequisite:
Introduction to evolutionary algorithm; Selection: rank-based, roulette wheel, stochastic, local, truncation and tournament; Recombination: discrete, real valued and binary valued; Mutation: real valued and binary valued; Reinsertion: global and local; Population models: global- worker/farmer, local – diffusion, and regional – migration; Co-evolution: cooperative and competitive; Learnable evolution model; Fast evolutionary programming; Application of evolutionary algorithms to: system design, telecommunication, robotics and other industrial areas.
