Colloquium: Iris Scheer (C&O)

The Airside Cargo Transportation Problem (ACTP) addresses efficient routing and scheduling of cargo vehicles carrying ULDs across the airport's service roads between the cargo terminal and passenger aircraft stands while adhering to operational and safety requirements. Key aspects of the ACTP include vehicle capacity utilization, differentiation between cargo commodities, and the consideration of time-dependent travel times. This paper presents a Mixed-Integer Programming (MIP) formulation of the ACTP as a Set Partitioning Problem. The sets cover all possible consolidations of various cargo transportation requests on paths generated using preprocessing algorithms. The ACTP is computationally feasible by applying a rolling horizon-based heuristic, making the subproblem formulations Mixed-Integer Linear Programming (MILP) models. The model is applied to a case study at Amsterdam Airport Schiphol (AAS) after a potential relocation of KLM Cargo's terminal. This relocation provides an unique opportunity to evaluate various strategies to optimize airside cargo transportation and study the implication for both KLM Cargo and AAS.

Supervisor: A. Bombelli