No polls currently selected on this page!


Repository is empty


Code: 92991
ECTS: 5.0
Lecturers in charge: doc. dr. sc. Goranka Nogo - Lectures
English level:


All teaching activities will be held in Croatian. However, foreign students in mixed groups will have the opportunity to attend additional office hours with the lecturer and teaching assistants in English to help master the course materials. Additionally, the lecturer will refer foreign students to the corresponding literature in English, as well as give them the possibility of taking the associated exams in English.

1. komponenta

Lecture typeTotal
Lectures 45
* Load is given in academic hour (1 academic hour = 45 minutes)
COURSE AIMS AND OBJECTIVES: Introduction to the classical meta-heuristic methods and their usage for solving hard combinatorial problems.

1. Introduction. Why are some problems difficult to solve. The size of the search space. Modeling the problem. Constraints.
2. Basic concepts. The objective. The evaluation function. Defining a search problem. Neighborhoods and local optima.
3. Traditional methods. Local and global search for SAT problem, the traveling salesman problem (TSP) and nonlinear programming problem (NLP). Linear programming. Greedy algorithms for SAT, TSP and NLP. Divide and Conquer. Dynamic programming.
4. Designing evolutionary algorithms. Representation. Evaluation function. Initialization. Selection. Mutation and crossover operators.
5. Escaping local optima. Simulated annealing. Tabu search.
6. Algorithm Analysis. Tuning the algorithm to the problem. Parameter control in evolutionary algorithms. Parent selection. Population. Genetic operators and their probabilities.
  1. Z. Michalewicz, D. B. Fogel: How to Solve It: Modern Heuristic
  2. J. Hromkovic: Algorithmics for Hard Computing Problems
3. semester
Izborni predmeti 4 i 5 - Regular study - Financial and Business Mathematics
Consultations schedule: