Equivalent to requirements for acceptance to the Master`s degree programme. Some undergraduate knowledge of algorithms or operations research is recommended. Some programming skills are also recommended, but not necessary

The course offers a review of and introduction to modern meta-heuristic methods suitable for solving real-world optimization tasks in logistics. The course is especially suitable for students that plan to focus their thesis on planning problems in manufacturing or distribution.

The course will include the following topics:

• Combinatorial optimization
• Local searches
• Local search based metaheuristics
• Population based metaheuristics
• Selection of methods to solve complex problems in a timely fashion

Practical examples will be used to illustrate

Reeves, Colin. Modern Heuristic Techniques for Combinatorial Optimization Problem
Lecture foils and relevant articles will be distributed by the lecturer