TU Wien:Mathematical Programming and Optimization in Transport Logistics VU (Raidl)

Daten

Vortragende	Georg Brandstätter• Matthias Prandtstetter• Günther Raidl• Ulrike Maria Ritzinger
ECTS	6,0
Letzte Abhaltung	2026S
Sprache	English
Mattermost	mathematical-programming-and-optimization-in-transport-logistic • Register • Mattermost-Infos
Links	tiss:192200

Zuordnungen

Masterstudium Data Science	Modul BDHPC/EX - Big Data and High Performance Computing - Extension (Gebundenes Wahlfach)
Masterstudium Business Informatics	Modul EE/EXT - Enterprise Engineering Extension (Gebundenes Wahlfach)
Masterstudium Logic and Computation	Modul Mathematical Programming and Optimization in Transport Logistics * (Gebundenes Wahlfach)
Masterstudium Software Engineering & Internet Computing (veraltet)	Modul Mathematical Programming and Optimization in Transport Logistics * (Gebundenes Wahlfach)

Inhalt

noch offen, bitte nicht von TISS/u:find oder Homepage kopieren, sondern aus Studierendensicht beschreiben.

Ablauf

noch offen

Benötigte/Empfehlenswerte Vorkenntnisse

noch offen

Vortrag

noch offen

Übungen

noch offen

Prüfung, Benotung

Summer term 2026, first exam; 120 Minutes time. 50 points in total, need 50% (25 points) to pass. Roughly looked like the following.

PART 1 - MATHEMATICAL PROGRAMMING

PART 1 MILP (25 Points)

1.1 Modeling task (10 Points) energy production p_h consumption d_h a battery with a capacity of 10 kWh and to always in every hour stay within 10% and 90% ((no var or param named)) battry at the start charged half inflow outflow of power always the same maximize profit

1.2 Modeling task (15 Points) ship/oil tanker, can decide if at atop sell oil or buy, traveling time, need to return home (t) after 90 days; start node s is not home (s≠t). there was some thing about selling oil such we are profitably and that we have to arrive home with an empty tank, so we should sell it best before in a most profitable way.

PART 2 Metaheuristics, Dynamic + stochastic fleet management, Exact methods for transport logistics (25 Points)

2.1 hungarian method: given matrix (and many blank matrices; matrix had four rows, 5 cols i think; forgot the exact application but maybe job and printer or similar), calculate optimal assignment and mark it in the first matrix

2.2 forward slack, given a table of ship(?) departments, arrivals, etc (i=0,1,2,3,4); also calculate one arrival time, one W_i and one l_i?

2.3. two ideas to implement routes/trips, for each two pros/cons

Dauer der Zeugnisausstellung

noch offen

Zeitaufwand

noch offen

Unterlagen

noch offen

Tipps

noch offen

Highlights / Lob

noch offen

Verbesserungsvorschläge / Kritik

noch offen

Materialien

Diese Seite hat noch keine Anhänge, du kannst aber neue hinzufügen.