Heuristic Algorithms
A.Y. 2024/2025
Learning objectives
The course aims to
- present the main paradigms to design heuristic algorithms for complex decision problems with particular emphasis on combinatorial optimization problems
- discuss the a priori and a posteriori methods to evaluate the effectiveness and efficiency of heuristic algorithms
- perform experimental activities designing heuristic algorithms based on the study of the problem, implementing them on a computer in a programming language, evaluating and comparing their performance on benchmark data
- present the main paradigms to design heuristic algorithms for complex decision problems with particular emphasis on combinatorial optimization problems
- discuss the a priori and a posteriori methods to evaluate the effectiveness and efficiency of heuristic algorithms
- perform experimental activities designing heuristic algorithms based on the study of the problem, implementing them on a computer in a programming language, evaluating and comparing their performance on benchmark data
Expected learning outcomes
The student will learn the main techniques to design heuristic algorithms and to quantitatively assess their performance. The student will learn to design and implement in a programming language heuristic algorithms and to evaluate their performance.
Lesson period: First semester
Assessment methods: Esame
Assessment result: voto verbalizzato in trentesimi
Single course
This course cannot be attended as a single course. Please check our list of single courses to find the ones available for enrolment.
Course syllabus and organization
Single session
Responsible
Lesson period
First semester
INF/01 - INFORMATICS - University credits: 6
Lessons: 48 hours
Professor:
Cordone Roberto
Shifts:
Turno
Professor:
Cordone RobertoProfessor(s)