Evolutionary Computation is a dynamic field at the intersection of computer science, mathematics, and biology, which harnesses the principles of natural evolution to solve complex optimization and search problems. Throughout the course, students will delve into the fundamental concepts underlying evolutionary algorithms, including population initialization, selection mechanisms, crossover and mutation operators, and termination criteria. Theoretical discussions will be complemented by hands-on programming assignments aimed at implementing and experimenting with genetic algorithms in diverse problem domains.
Prerequisites
COMP6120 or Instructor approval