Lesson plan / GENETIC ALGORITHMS

Lesson Information

Course Credit 3.0
Course ECTS Credit 4.0
Teaching Language of Instruction Türkçe
Level of Course Bachelor's Degree, TYYÇ: Level 6, EQF-LLL: Level 6, QF-EHEA: First Cycle
Type of Course Programme Elective
Mode of Delivery Face-to-face
Does the course require compulsory or optional work experience? S
Course Coordinator
Instructor (s)
Course Assistant

Purpose and Content

The aim of the course Difficults in solving complex practical problems by using traditional Optimization and Search metods. Genetic Algorithms as a new tool for solving such problems.
Course Content Investicatoin of the structures of traditional optimization and search methods, difficults in their applications to the practical problems. GA as a new approach in this situations. Basics of the GA structure, its application requirements, properties of the application areas, examples of its using to solve problems that is difficult to solve by traditional approaches.

Weekly Course Subjects

1Introduction
2Foundations of GAs.
3Traditional optimization and search methods.
4Biological optimization-Natural selection.
5Components of Binary GAs.
6Variables selection, cost function, and population.
7GA's operations: reproduction, crossover, and mutation.
8Mid-term exam.
9GAs at work: Simulation by hand.
10The fundamental theorem of the GAs.
11Computer implementation of GAs.
12The continuouş GAs.
13Variable encoding, precition, and bounds.
14Examples: Applications to practical problems.

Resources

1-Gen M., Cheng R. "Genetic Algorithms and Engineering Design", John Wiley & Sons, 1997.

2-Haupt R.L. & Haupt S.E. "Practical Genetic Algorithms", John Wiley & Sons, 2004.