Formation and Routing of Worker Teams for Airport Ground Handling Operations: A Branch-and-Price-and-Check Approach

Giacomo Dall'Olio, Rainer Kolisch

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

We address workforce optimization for ground handling operations at the airport, focusing on baggage loading and unloading. Teams of skilled workers have to be formed and routed across the apron to unload the baggage from the aircraft after a landing and to load it before takeoff. Such tasks must be performed within time windows and require a team of workers with different skill levels. The goal is to find a feasible plan that minimizes the sum of the tasks completion times. We formalize a variation of the workforce scheduling and routing problem, integrating team formation, hierarchical skills with downgrading, multiple trips, and different execution modes. We propose a solution approach based on branch-and-price-and-check and test it on real-world instances from a major European hub airport. We propose a model based on the Dantzig-Wolfe decomposition. In the pricing problem, we generate tours of teams as shortest paths with constrained resources in a network. In the master problem, we select an optimal set of tours that do not exceed the workforce availability. Our experiments show that the proposed algorithm can produce optimal solutions for small- and medium-sized instances and good or optimal solutions for large instances. The results also show that our approach outperforms the current airport dispatching policy.

Original languageEnglish
Pages (from-to)1231-1251
Number of pages21
JournalTransportation Science
Volume57
Issue number5
DOIs
StatePublished - 2023

Keywords

  • airport operations
  • downgrading
  • hierarchical skills
  • routing
  • workforce scheduling

Fingerprint

Dive into the research topics of 'Formation and Routing of Worker Teams for Airport Ground Handling Operations: A Branch-and-Price-and-Check Approach'. Together they form a unique fingerprint.

Cite this