Airport and Cargo Operations

The course consists of the following lectures:

Lecture 1 Introduction

Lecture 2 Landside operations

Lecture 3 Airside operations

Lecture 4 The Gate assignment problem

Lecture 5 The Aircraft taxiing problem

Lecture 6 Air cargo supply chain

Lecture 7 Bin packing problems in air cargo operations

Lecture 8 Introduction to graph theory and scheduling problems

Lecture 9 Introduction to stochastic programming

Lecture 10-14 Guest lectures

A short quiz is given after lectures 2 to 9. Bonus points for the test can be earned by participating in these quizzes. Note that the sequence of the lectures might change pending the availability of the invited speakers. In addition, if not enough invited speakers are found, such lectures will be replaced with lectures covering additional topics (e.g., uncertainty in airport operations) or a Q&A related to the assignment.

Knowledge of linear optimization and familiarity with Mixed Integer Linear Programming (MILP) formulations is a strongly suggested pre-requisite because many models presented in the lecture and the assignment are MILPs that the students must understand and (potentially) reproduce. Additional resources, examples, and tutorials will be provided to help students.