Universität Wien

390050 DK PhD-L: Advanced Topics in Operations Management (2013W)

Continuous assessment of course work

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).

Details

max. 15 participants
Language: English

Lecturers

Classes (iCal) - next class is marked with N

  • Monday 11.11. 08:00 - 12:00 Seminarraum 6 Oskar-Morgenstern-Platz 1 1.Stock
  • Monday 11.11. 14:00 - 16:00 Seminarraum 6 Oskar-Morgenstern-Platz 1 1.Stock
  • Tuesday 12.11. 08:00 - 14:00 Seminarraum 6 Oskar-Morgenstern-Platz 1 1.Stock
  • Tuesday 12.11. 14:00 - 16:00 Seminarraum 6 Oskar-Morgenstern-Platz 1 1.Stock
  • Wednesday 13.11. 10:00 - 16:00 Seminarraum 4 Oskar-Morgenstern-Platz 1 1.Stock
  • Monday 09.12. 08:00 - 12:00 Seminarraum 5 Oskar-Morgenstern-Platz 1 1.Stock
  • Monday 09.12. 14:00 - 16:00 Seminarraum 5 Oskar-Morgenstern-Platz 1 1.Stock
  • Tuesday 10.12. 08:00 - 12:00 Seminarraum 4 Oskar-Morgenstern-Platz 1 1.Stock
  • Tuesday 10.12. 14:00 - 16:00 Seminarraum 15 Oskar-Morgenstern-Platz 1 3.Stock
  • Wednesday 11.12. 08:00 - 10:00 Seminarraum 13 Oskar-Morgenstern-Platz 1 2.Stock
  • Wednesday 11.12. 12:00 - 16:00 Seminarraum 13 Oskar-Morgenstern-Platz 1 2.Stock
  • Thursday 12.12. 08:00 - 12:00 Seminarraum 4 Oskar-Morgenstern-Platz 1 1.Stock
  • Thursday 12.12. 14:00 - 16:00 Seminarraum 13 Oskar-Morgenstern-Platz 1 2.Stock
  • Friday 13.12. 08:00 - 12:00 Seminarraum 14 Oskar-Morgenstern-Platz 1 2.Stock
  • Friday 13.12. 14:00 - 16:00 Seminarraum 13 Oskar-Morgenstern-Platz 1 2.Stock

Information

Aims, contents and method of the course

Dynamic (or real-time) vehicle routing (VR) is characterized by the fact that part of the data become known during the execution of the routes only, so that planning and execution are interlinked. While the algorithms used for dynamic VR are mainly the same as for static VR – in particular metaheuristics –, the planning scenarios are quite different and occur in many variants.
The focus of this course is less on algorithms, but rather on the various fields of application, problem settings, and planning frameworks, which entail specific requirements for the algorithms.

Assessment and permitted materials

Students write, in teams of two, a working paper on an agreed special subject and present it in the class. The following (not exhaustive) list specifies potential themes, each with a recent paper as entry point to the relevant literature:
Time-dependant travel times (Potvin et al, 2006)
The dynamic dial-a-ride problem (Attanasio et al, 2004)
Urban/Home delivery (Magalhaes et al, 2006)
Internal transport (Le Anh et al, 2010)
Agent-based planning (Mes et al, 2010)
Waiting strategies (Pureza et al, 2008)
Evaluation and Grading
The course grades will be based on the following criteria:
class participation 20 %
working paper 40 %
presentation 40 %

Minimum requirements and assessment criteria

Examination topics

Reading list


Association in the course directory

Last modified: Mo 07.09.2020 15:46