040676 KU Metaheuristics (MA) (2022S)
Continuous assessment of course work
Labels
Registration/Deregistration
Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).
- Registration is open from Mo 07.02.2022 09:00 to Mo 21.02.2022 23:59
- Registration is open from Th 24.02.2022 09:00 to Fr 25.02.2022 23:59
- Deregistration possible until Mo 14.03.2022 23:59
Details
max. 30 participants
Language: English
Lecturers
Classes (iCal) - next class is marked with N
- Wednesday 02.03. 11:30 - 13:00 Digital
- Wednesday 09.03. 11:30 - 13:00 Digital
- Wednesday 16.03. 11:30 - 13:00 Digital
- Wednesday 23.03. 11:30 - 13:00 Digital
- Wednesday 30.03. 11:30 - 13:00 Digital
- Wednesday 06.04. 11:30 - 13:00 Digital
- Wednesday 27.04. 11:30 - 13:00 Digital
- Wednesday 04.05. 11:30 - 13:00 Digital
- Wednesday 11.05. 11:30 - 13:00 PC-Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Untergeschoß
-
Wednesday
18.05.
11:30 - 13:00
Hörsaal 6 Oskar-Morgenstern-Platz 1 1.Stock
PC-Seminarraum 5 Oskar-Morgenstern-Platz 1 1.Untergeschoß - Wednesday 25.05. 11:30 - 13:00 Digital
- Wednesday 01.06. 11:30 - 13:00 Digital
- Wednesday 08.06. 11:30 - 13:00 Digital
Information
Aims, contents and method of the course
Assessment and permitted materials
* [45%] Exam
- 90 minutes
- pen-and-paper, closed book
* [45%] Project work (choose one):
- Mini-Coding-Project: implement a metaheuristic for an
optimisation problem
- Literature work: read a scientific article, summarise, analyse
and criticise it
* [10%] Oral presentation of project
- 90 minutes
- pen-and-paper, closed book
* [45%] Project work (choose one):
- Mini-Coding-Project: implement a metaheuristic for an
optimisation problem
- Literature work: read a scientific article, summarise, analyse
and criticise it
* [10%] Oral presentation of project
Minimum requirements and assessment criteria
In order to obtain a positive grade on the course, at least 50% of the overall points have to be achieved. The grades are distributed as follows:
1: 87% to 100%
2: 75% to <87%
3: 63% to <75%
4: 50% to <63%
5: <50%
1: 87% to 100%
2: 75% to <87%
3: 63% to <75%
4: 50% to <63%
5: <50%
Examination topics
* Analysis of algorithms and complexity theory (basics)
* Local search methods
* Nature-inspired metaheuristics
* Construction-based metaheuristics
* Local search methods
* Nature-inspired metaheuristics
* Construction-based metaheuristics
Reading list
* Handbook of Metaheuristics, Michel Gendreau & Jean-Yves Potvin, International Series in Operations Research & Management Science, Springer, ISBN 978-3-319-91085-7
* Handbook of Metaheuristics, Fred Glover & Gary A. Kochenberger, Kluwer’s International Series, ISBN 1-4020-7263-5
* Stochastic Local Search, Foundations and Applications, Holger H. Hoos & Thomas Stützle, Elsevier, ISBN 1-55860-872-9
* Search Methodologies, Introductory Tutorials in Optimization and Decision Support Techniques, Edmund K. Burke & Graham Kendall, Springer, ISBN 0-387-23460-8
* Handbook of Metaheuristics, Fred Glover & Gary A. Kochenberger, Kluwer’s International Series, ISBN 1-4020-7263-5
* Stochastic Local Search, Foundations and Applications, Holger H. Hoos & Thomas Stützle, Elsevier, ISBN 1-55860-872-9
* Search Methodologies, Introductory Tutorials in Optimization and Decision Support Techniques, Edmund K. Burke & Graham Kendall, Springer, ISBN 0-387-23460-8
Association in the course directory
Last modified: Th 11.05.2023 11:27
Metaheuristics are particularly attractive in the efficient and effective solution of logistic decision problems in supply chains, transportation, telecommunications, vehicle routing and scheduling, manufacturing and machine scheduling, timetabling, sports scheduling, facility location and layout, and network design, among other areas.The objective of this course is to provide students with the fundamental tools for designing, tuning, and testing heuristics and metaheuristics for hard combinatorial optimization problems. Besides that, we will also cover the fundamental concepts of complexity theory that are the key to understanding the need for approximate approaches and to design efficient heuristics and metaheuristics. The outline of the covered topics will be:
1. A gentle introduction to the analysis of algorithms and complexity theory
2. Historical and modern local search methods
3. Nature-inspired metaheuristics
4. Construction-based metaheuristicsFor assessment students will have to do a project work (in groups of up to 3 people), which they also have to present, and there will be an exam.The mode of teaching will be a mix of remote and on-site lectures. That is, the course will be structured as follows:
* 8 lectures (remote, mainly presentation by lecturer with some interactive elements, 02.03. - 04.05.2022)
* 1 Q&A-Session (on-site, optional, 11.05.2022)
* 1 Exam (on-site, 18.05.2022)
* 2 dates for project work presentations (remote, 25.05. & 01.06.2022)
* Deadline for handing in the project work: 08.06.2022ATTENTION: The lectures and the project work presentations will be remote (via a conferencing-tool in Moodle), while the exam and the Q&A-Session will be on-site (i.e., at the university in a classroom).