In this study, the authors propose the formalisation of the Simultaneous Slot Allocation Problem (SSAP), that extends, in two directions, the current way of allocating airport slots in Europe. The SSAP requires, first, to perform the slot allocation at all airports simultaneously and, second, to respect airspace sector capacities. The authors solve the SSAP with two algorithms based on metaheuristics, namely Iterated Local Search and Variable Neighborhood Search, and with an algorithm based on an integer linear programming model. They compare these algorithms on randomly generated instances and show that for small instances metaheuristics are competitive with the integer linear programming model. Nevertheless, the integer linear programming model is unable to solve medium or large instances because of memory and computation time requirements. Metaheuristics, instead, can deal with large instances, allocating slots to more than 99.8% of flights.

Metaheuristic algorithms for the simultaneous slot allocation problem

CASTELLI, LORENZO;
2012-01-01

Abstract

In this study, the authors propose the formalisation of the Simultaneous Slot Allocation Problem (SSAP), that extends, in two directions, the current way of allocating airport slots in Europe. The SSAP requires, first, to perform the slot allocation at all airports simultaneously and, second, to respect airspace sector capacities. The authors solve the SSAP with two algorithms based on metaheuristics, namely Iterated Local Search and Variable Neighborhood Search, and with an algorithm based on an integer linear programming model. They compare these algorithms on randomly generated instances and show that for small instances metaheuristics are competitive with the integer linear programming model. Nevertheless, the integer linear programming model is unable to solve medium or large instances because of memory and computation time requirements. Metaheuristics, instead, can deal with large instances, allocating slots to more than 99.8% of flights.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11368/2654106
 Avviso

Registrazione in corso di verifica.
La registrazione di questo prodotto non è ancora stata validata in ArTS.

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 32
  • ???jsp.display-item.citation.isi??? 22
social impact