EURO 2025 Leeds
Abstract Submission

1747. Disruption management in airline luggage handling using local search

Invited abstract in session TD-57: Air transportation II, stream Transportation.

Tuesday, 14:30-16:00
Room: Liberty 1.12

Authors (first author is the speaker)

1. Lisanne Heuseveldt
Information and Computing Sciences, Utrecht University
2. Marjan van den Akker
Information and Computing Sciences, Utrecht University
3. Ali Poursaeidesfahani
KLM Royal Dutch Airlines
4. Philip de Bruin
Information and Computing Sciences, Utrecht University

Abstract

Flight times are influenced by many factors. Examples are weather conditions or congestion at the airport, leading to ATC delays or limited gate availability. Since COVID-19, ground personnel for loading and unloading luggage to and from an aircraft are scarcely available, so we need to deploy them efficiently. Because of this scarcity, the process is highly sensitive to the variation of arrival times. To deal with this, we develop a fast local search algorithm to (re)schedule the allocation of the luggage handlers.

We consider the assignment of luggage handlers to tasks arising from arriving and departing aircraft on the day of operations. We aim to make real-time updates that solve disruptions and are cost-efficient. This problem can be considered as a technician routing and scheduling problem (TRSP), where we consider teaming, skill and time window constraints in a dynamic setting. We have to synchronise multiple tasks corresponding to the same flight, which is a new aspect in regard to TRSP literature. Our algorithm proposes delays or cancellations of flights; these levers are often unexplored from a ground operations perspective.

In the dedicated local search, we focus on conflicts caused by disruptions and solve these using a simulated annealing algorithm. We show that this solves the problem in real-time. We will present computational results from experiments with real-life data provided by KLM Royal Dutch Airlines.

Keywords

Status: accepted


Back to the list of papers