Introduction to graph theory

Shortest Path Problem

Traveling Salesman Problem

Vehicle Routing Problem

Basics of metaheuristics

The course conveys knowledge of basic quantitative methods for solving planning problems in transport and logistics. In the course, the theoretical foundations of the respective planning methods are presented, specific examples are worked on and practical applications are shown.

In this way, students should develop a basic understanding of logistical planning problems and suitable solution methods. After successfully completing the course the participants should be able to grasp a given problem in a quantitative (linear) model, to apply methods and techniques of transport and distribution planning, to explain basic concepts of graph theory, in relation to logistic questions, such as the determination of shortest paths to set and apply selected methods and procedures of tour planning.

Lectures, teamwork, homework and exercises

Additional tutorials are offered (not obligatory but highly recommended):

Dates will follow soon

Homework: 15%

Teamwork: 15%

Quizzes: 20%

Final exam: 50%

Lectures start punctually. In case of in-class assignments, be aware that they are most likely to take place at the beginning of a lecture. If students are absent during the in-class assignments no make-up assignments are granted.

If a student misses the final exam, he or she can repeat the exam only if he or she provides sufficient proof of the necessity of the absence (illness, accident…). If the student misses a performance assessment worth less than 50% of the grade (e.g. a mid-term quiz), opportunities to repeat the assessment can be provided optionally by the lecturers and in any case require sufficient proof for the necessity of the absence as well. See further: https://www.wu.ac.at/en/students/my-degree-program/bachelors-student-guide/course-and-exam-information/courses-with-continuous-assessment-pi/

Cooperation with other students on homework assignments is encouraged. However, the final write-up must be done individually. ‘Duplicate’ homework write-ups are unacceptable and will receive a score of zero. (Any homework that is late will receive a score of zero.)

The final exam has to be passed with at least 50% of maximum points (passing the final exam is mandatory for positive evaluation of this course)

Attendance in the first lecture is mandatory for the participation in the course. If an absence cannot be avoided inform the lecturer  before class and provide some form of proof for the absence (e.g. medical confirmation) in the next session. In total, a minimum requirement for attendance of 80% is required to pass the course.

If the attendance falls below 80% for students receiving partial credit, students are graded with 5 (Nicht genügend). See further: https://www.wu.ac.at/fileadmin/wu/h/students/Pruefungsorganisation/Gesetzesgrundlagen/Pruefungsordnung_03.12.2014.pdf

Organisatorische Fragen zur Zulassung/Aufnahme

Admission for the SBWL is done by the institute for transport and logistics management: https://www.wu.ac.at/itl/lehre/bachelor/sbwl/sns/

Additional questions related to Admission, please refer to sbwl-sns@wu.ac.at

The previous completion of a course introducing linear and integer programming is recommended for the participation in this course

Via email and after the session

For simplified communication please register at: https://mailman.wu.ac.at/mailman/listinfo/supply.networks

There is a facebook-group: https://www.facebook.com/groups/1613151662283669/?fref=ts

We recommend the speaker series of the Research Institute for Supply Chain Management: https://www.wu.ac.at/en/scm/