An Analysis of Robustness Approaches for the Airport Baggage Sorting Station Assignment Problem

Abstract EN

In the Airport Baggage Sorting Station Assignment Problem (ABSSAP), the Baggage Sorting Stations (BSSs) are assigned to flights for the period of time necessary to perform their service for a given flights’ schedule.

But the flights schedule may change on the day of operation which may deem the original assignment of some flights to BSSs infeasible.

These changes may create conflicts between those flights whose schedules have changed and may not be restricted to those flights but propagating to the other flights for different reasons.

Conflicts depend on the original assignments for the real arrival and departure flight times on the day of operation.

It is therefore desirable to consider potential delays on the day of operation when generating the original flight assignments to BSSs, such that the final flight assignments differ little or do not differ at all from the original assignments on the day of operation.

The term robustness is here used to give an indication of the degree to which this has been achieved.

Some existing approaches originally presented in the Airport Gate Assignment Problem (AGAP) are adapted to the ABSSAP, other approaches are suggested for generating assignments which take account of potential perturbations on the day of operation for the ABSSAP, and all of them are then compared.

It is shown that the suggested approaches by themselves do not perform better than the other considered approaches but when combined they enhance the result further compared to when each approach is used alone.