Introduction to graph theory
Shortest Path Problem
Traveling Salesman Problem
Vehicle Routing Problem
Basics of metaheuristics
Syllabus
Title
1294 Specialisation in Business Administration Course II - Analysis and Optimization of Distribution Networks
Instructors
Dr. Alexandra Anderluh, Belma Turan, Ph.D.
Type
PI
Weekly hours
2
Language of instruction
Englisch
Registration
09/19/19 to 09/22/19
Registration via LPIS
Registration via LPIS
Notes to the course
Subject(s) Bachelor Programs
Dates
| Day | Date | Time | Room |
|---|---|---|---|
| Tuesday | 12/10/19 | 09:00 AM - 11:30 AM | D3.0.225 |
| Thursday | 12/12/19 | 08:00 AM - 10:30 AM | TC.5.03 |
| Tuesday | 12/17/19 | 08:30 AM - 11:00 AM | D5.0.002 |
| Thursday | 12/19/19 | 08:00 AM - 10:30 AM | TC.3.21 |
| Tuesday | 01/07/20 | 09:00 AM - 11:30 AM | TC.5.03 |
| Thursday | 01/09/20 | 08:00 AM - 10:30 AM | TC.5.01 |
| Tuesday | 01/14/20 | 09:00 AM - 11:30 AM | EA.6.026 |
| Thursday | 01/16/20 | 09:00 AM - 11:30 AM | TC.2.03 |
| Thursday | 01/23/20 | 09:00 AM - 11:30 AM | TC.0.01 ERSTE |
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.
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
Lectures, teamwork, case study and exercises
Additional tutorials are offered (not mandatory but highly recommended)
Case Study: 13%
Teamwork: 13%
Quizzes: 24%
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…). See further: https://www.wu.ac.at/en/students/my-degree-program/bachelors-student-guide/course-and-exam-information/courses-with-continuous-assessment-pi/
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).
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
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/
Last edited: 2019-11-27
Back