Achtung! Das Lehrangebot ist noch nicht vollständig und wird bis Semesterbeginn laufend ergänzt.
040186 KU Transportation Logistics (MA) (2026S)
Prüfungsimmanente Lehrveranstaltung
Labels
The course language is English.Only students who signed up for the class in univis/u:space are allowed to take the class (that means, that you have to at least be on the waiting list if you want to take this class). No exceptions possible.
An/Abmeldung
Hinweis: Ihr Anmeldezeitpunkt innerhalb der Frist hat keine Auswirkungen auf die Platzvergabe (kein "first come, first served").
- Anmeldung von Mo 09.02.2026 09:00 bis Di 17.02.2026 12:00
- Anmeldung von Di 24.02.2026 09:00 bis Mi 25.02.2026 12:00
- Abmeldung bis Sa 14.03.2026 23:59
Details
max. 50 Teilnehmer*innen
Sprache: Englisch
Lehrende
Termine
Dienstag 13.15-14.45 Uhr HS 10
Donnerstag 09.45-11.15 Uhr HS 3
Termine:
03.03,05.03,
17.03,19.03,
14.04,16.04,
07.05 (midterm exam)
19.05,21.05,
09.06,11,06,
16.06,18.06,
23.06 (endterm exam)
Information
Ziele, Inhalte und Methode der Lehrveranstaltung
This course is an introduction to optimisation problems that appear in Transportation Logistics. Along the semester, we will cover several of these problems, and study their corresponding mathematical formulations and solution methods.Some problems covered in the lecture are: shortest paths, traveling salesman, vehicle routing, and arc routing problems, and maybe others.Among the methods we will learn: combinatorial algorithms, modelling and solving problems as mixed-integer programs, heuristics, dynamic programming, and branch-and-bound.This course is broad rather than deep, which means that we emphasise covering a good number of problems and methods, without spending too much time in any of them. The focus is on learning methods, and developing intuition behind why they work.
Art der Leistungskontrolle und erlaubte Hilfsmittel
2 exams, each corresponding to 40% of the final grade.
Several homeworks to be announced every week, and handed in in the beginning of the following class. These account for the remaining 20% of the grade.
Several homeworks to be announced every week, and handed in in the beginning of the following class. These account for the remaining 20% of the grade.
Mindestanforderungen und Beurteilungsmaßstab
Students should be familiar with Excel (also with the Solver), and have basic knowledge about linear programming (i.e., understand a mathematical formulations, and know about solution techniques).This course requires a somewhat higher level of abstraction, when compared to a Bachelor course. Students are expected to spend around 1-2 hours per week in out-of-class studies (reviewing the content, and preparing the homeworks).
Prüfungsstoff
Slides will be available through Moodle, and are sufficient for covering all the content of the course.
Literatur
Slides will be available through Moodle.
Excerpt of the recommended literature on the slides:
- Gianpaolo Ghiani, Gilbert Laporte, and Roberto Musmanno. Introducing logistics. In
Introduction to Logistics Systems Management, pages 1–43. John Wiley & Sons,
Ltd, 2013. doi: 10.1002/9781118492185.ch1.- R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms, and
Applications. Prentice Hall, Englewood Cliffs, New Jersey, 1993. ISBN
0-13-617549-X.- Gregory Gutin and Abraham P Punnen. The Traveling Salesman Problem and Its
Variations, volume 12. Springer Science & Business Media, 2006.- Paolo Toth and Daniele Vigo, editors. Vehicle routing: Problems, methods, and
applications, volume 18 of MOS-SIAM Series on Optimization. SIAM, Philadelphia,
PA, 2014.-Corberán, Ángel, and Gilbert Laporte, eds. Arc routing: problems, methods, and applications.
Society for Industrial and Applied Mathematics, 2015.For a quick review of linear programming, including the simplex method, students are referred to:
Hillier, Lieberman. Introduction to Operations Research. Chapters 1-5.
Excerpt of the recommended literature on the slides:
- Gianpaolo Ghiani, Gilbert Laporte, and Roberto Musmanno. Introducing logistics. In
Introduction to Logistics Systems Management, pages 1–43. John Wiley & Sons,
Ltd, 2013. doi: 10.1002/9781118492185.ch1.- R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms, and
Applications. Prentice Hall, Englewood Cliffs, New Jersey, 1993. ISBN
0-13-617549-X.- Gregory Gutin and Abraham P Punnen. The Traveling Salesman Problem and Its
Variations, volume 12. Springer Science & Business Media, 2006.- Paolo Toth and Daniele Vigo, editors. Vehicle routing: Problems, methods, and
applications, volume 18 of MOS-SIAM Series on Optimization. SIAM, Philadelphia,
PA, 2014.-Corberán, Ángel, and Gilbert Laporte, eds. Arc routing: problems, methods, and applications.
Society for Industrial and Applied Mathematics, 2015.For a quick review of linear programming, including the simplex method, students are referred to:
Hillier, Lieberman. Introduction to Operations Research. Chapters 1-5.
Zuordnung im Vorlesungsverzeichnis
VM1 Wahlpflicht, VM17 Wahlpflicht
Letzte Änderung: Di 03.03.2026 16:45