13S074IOA - Optimization algorithms in engineering
Course specification | ||||
---|---|---|---|---|
Course title | Optimization algorithms in engineering | |||
Acronym | 13S074IOA | |||
Study programme | Software Engineering | |||
Module | ||||
Type of study | bachelor academic studies | |||
Lecturer (for classes) | ||||
Lecturer/Associate (for practice) | ||||
Lecturer/Associate (for OTC) | ||||
ESPB | 6.0 | Status | elective | |
Condition | None. | |||
The goal | Introduction to widely used classes of optimization algorithms commonly used in engineering and IT applications. | |||
The outcome | Students will be able to apply outlined optimization algorithms for solving practical problems. | |||
Contents | ||||
URL to the subject page | http://mtt.etf.rs/si/ioa.htm | |||
Contents of lectures | Terminology. Formal definition of an optimization problem. Classification of optimization problems. Random search, systematic search, traditional methods, simplex algorithm, genetic algorithm, simulated annealing, particle swarm optimization and differential evolution. Multicriteria optimization. Pareto front and its estimation using optimization algorithms. Examples of practical applications. | |||
Contents of exercises | Computer oriented work and individual projects. | |||
Literature | ||||
| ||||
Number of hours per week during the semester/trimester/year | ||||
Lectures | Exercises | OTC | Study and Research | Other classes |
2 | 2 | 1 | ||
Methods of teaching | Lectures, tests, homeworks and individual projects. | |||
Knowledge score (maximum points 100) | ||||
Pre obligations | Points | Final exam | Points | |
Activites during lectures | Test paper | 30 | ||
Practical lessons | 30 | Oral examination | ||
Projects | ||||
Colloquia | 40 | |||
Seminars |