STO/Lec

From WikiZMSI

Spis treści 1 Lecture 1 -- An introduction 2 Lecture 2-3 -- The Structure of Optimization 3 Lecture 4-5 -- Optimization problems - key components 4 Lecture 6 -- Hill-Climbing 5 Lecture 7 -- Simulated Annealing 6 Lecture 8-9 -- Evolutionary Algorithm

Lecture 1 -- An introduction

1. Presentation
2. Thomas Weise [1]
   1. Reading: chapter 1

Lecture 2-3 -- The Structure of Optimization

Thomas Weise chapter 2

1. Reading: chapter 2.1, 2.2, 2.3
2. Based on what you have read answer the following questions:
   1. What is a candidate solution for n-queens problem give the example?
   2. What is a solution space for n-queens problem give the example?
   3. What is feasible and unfeasible solution in n-queens problem give the example?

Lecture 4-5 -- Optimization problems - key components

Thomas Weise chapter 2

1. Reading: chapter 2.4, 2.5, 2.6, 2.7 and 2.8
2. Based on what you have read answer the following questions:
   1. What is an objective function in n-queens problem?
   2. What is a global optimum om n-queens problem, give an example?
   3. What is a search space in n-queens problem give the example?

Lecture 6 -- Hill-Climbing

Thomas Weise chapter 3.3

1. Reading: chapter 3.3
2. Based on what you have read answer the following questions:
   1. What unary operations you can find for n-queens problem?
   2. Rewrite 3.3.2.1 The Algorithm making it n-queens problem specific.

Lecture 7 -- Simulated Annealing

Thomas Weise chapter 3.5

1. Reading: chapter 3.5

Lecture 8-9 -- Evolutionary Algorithm

Thomas Weise chapter 3.4

1. Reading: chapter 3.4
2. Based on what you have read answer the following questions:
   1. Rewrite 3.4.1.1 The Algorithm (without Recombination) making it n-queens problem specific