After successful completion of the course, students are able to understand and apply the basics of modeling, algorithms, operations research, heuristic optimization. Advanced optimization techniques: branch-and-cut, branch-and-price, metaheuristics.  Focus will be placed on classical transportation problems such as TSP, vehicle routing, shipment.

Basics: modeling, algorithms, operations research, heuristic optimization. Advanced optimization techniques: branch-and-cut, branch-and-price, metaheuristics. Classical transportation problems: TSP, vehicle routing, shipment Didactics: - weekly lecture - exercise - oral exam

The VU is held in blocks on selected dates. In addition to the lecture units, students work through calculation examples at home on one date after preparation. A programming task serves to consolidate the course content. The VU concludes with an exam.

Estimated Effort:

15h  Lecture
10h  Homework
15h  Programming Exercise I
15h  Programming Exercise II
20h  Exam Preparation and Exam
----------------------------------------------
75h Total

The exam will be based on the material covered during the course.

• Toth, Paolo, and Daniele Vigo, eds. Vehicle routing: problems, methods, and applications. Vol. 18. Siam, 2014.
• Gendreau, M., & Potvin, J. Y. (2010). Handbook of metaheuristics (Vol. 2). New York: Springer.

Requirements:

• knowledge of basic algorithms and data structures
• knowledge of linear algebra and analysis, especially set theory, metrics, sequences and series