040186 KU Transportation Logistics (MA) (2025S)
Continuous assessment of course work
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.
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 10.02.2025 09:00 to Tu 18.02.2025 12:00
- Registration is open from We 26.02.2025 09:00 to Th 27.02.2025 12:00
- Deregistration possible until Fr 14.03.2025 23:59
Details
max. 50 participants
Language: English
Lecturers
Classes (iCal) - next class is marked with N
- Tuesday 04.03. 13:15 - 14:45 Hörsaal 10 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 11.03. 13:15 - 14:45 Hörsaal 10 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 18.03. 13:15 - 14:45 Hörsaal 10 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 25.03. 13:15 - 14:45 Hörsaal 10 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 01.04. 13:15 - 14:45 Hörsaal 10 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 08.04. 13:15 - 14:45 Hörsaal 10 Oskar-Morgenstern-Platz 1 2.Stock
- N Tuesday 29.04. 13:15 - 14:45 Hörsaal 10 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 06.05. 13:15 - 14:45 Hörsaal 10 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 13.05. 13:15 - 14:45 Hörsaal 10 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 20.05. 13:15 - 14:45 Hörsaal 10 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 27.05. 13:15 - 14:45 Hörsaal 10 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 03.06. 13:15 - 14:45 Hörsaal 10 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 10.06. 13:15 - 14:45 Hörsaal 10 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 17.06. 13:15 - 14:45 Hörsaal 10 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 24.06. 13:15 - 14:45 Hörsaal 10 Oskar-Morgenstern-Platz 1 2.Stock
Information
Aims, contents and method of the course
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.
Assessment and permitted materials
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.
Minimum requirements and assessment criteria
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).
Examination topics
Slides will be available through Moodle, and are sufficient for covering all the content of the course.
Reading list
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.
Association in the course directory
Last modified: Tu 04.03.2025 11:06