Optimizing Outbound Baggage Handling at KLM

Optimizing Outbound Baggage Handling at KLM

van Loenhout, Steffie (TU Delft Electrical Engineering, Mathematics and Computer Science)

van Essen, Theresia (mentor)
Aardal, Karen (graduation committee)
Kraaikamp, Cornelis (graduation committee)

Delft University of Technology

Electrical Engineering

2019-01-23

In order to handle the increase in baggage units, KLM needs to optimize the outbound baggage handling process. This study focuses on accurately modeling the outbound baggage handling process while minimizing the number of employees working on this process. The results are based upon data on the outbound baggage handling process at KLM in 2018. In order to create a feasible lateral planning, the satisfaction of the demand and the rules on positioning certain flights have been implemented as hard constraints. ORTEC already created a basic model for assigning flights to baggage halls. However, this model did not lead to the expected improvements and did not model reality very well, and therefore, some extra extensions are needed. The first extension focuses on planning the outbound baggage handling process on a more detailed level, by assigning flights to specific laterals and baggage sections. Several methods are considered to construct this more detailed planning: a mixed integer programming formulation, a hierarchical solution method and column generation. For the mixed integer programming formulation, several speed-ups and valid inequalities are suggested, as first tests showed that the LP-relaxation provides a weak lower bound on the optimal solution.
The MIP and hierarchical solution method resulted to outperform the other methods for small data instances created. Because the flight schedule does not result in feasible solutions for the first extension, delaying lateral opening times is allowed under certain circumstances, in the second extension of this research. This results in more flexibility and feasible solutions can be obtained for the flight schedules. The hierarchical solution method resulted in the best feasible objective value within a certain time limit.
Driving tasks, which need to be fulfilled in order to bring the baggage to the corresponding departing aircraft, are added in the last extension of the research, such that the number of drivers can be minimized together with the employees working in the baggage hall. The lateral plannings constructed in this research meet all the constraints which are based on the daily operation, such that the reality is accurately modelled.

Outbound baggage handling
Mixed integer programming
Valid inequalities
Column Generating
Symmetry Breaking Constraints

http://resolver.tudelft.nl/uuid:3c255a45-c3a8-4437-8991-80f5561e929e

2021-01-23

Student theses

master thesis

© 2019 Steffie van Loenhout