In a scenario characterized by a continuous growth of air transportation demand, the runways of large airports serve hundreds of aircraft every day. Aircraft sequencing is a challenging problem that aims to increase runway capacity in order to reduce delays as well as the workload of air traffic controllers. In many cases, the air traffic controllers solve the problem using the simple “first-come-first-serve” (FCFS) rule. In this paper, we present a rolling horizon approach which partitions a sequence of aircraft into chunks and solves the aircraft sequencing problem (ASP) individually for each of these chunks. Some rules for deciding how to partition a given aircraft sequence are proposed and their effects on solution quality investigated. Moreover, two mixed integer linear programming models for the ASP are reviewed in order to formalize the problem, and a tabu search heuristic is proposed for finding solutions to the ASP in a short computation time. Finally, we develop an IRHA which, using different chunking rules, is able to find solutions significantly improving on the FCFS rule for real-world air traffic instances from Milano Linate Airport.

Improved rolling horizon approaches to the aircraft sequencing problem / Furini, F.; Kidd, M. P.; Persiani, C. A.; Toth, P.. - In: JOURNAL OF SCHEDULING. - ISSN 1094-6136. - 18:5(2015), pp. 435-447. [10.1007/s10951-014-0415-8]

Improved rolling horizon approaches to the aircraft sequencing problem

Furini F.;
2015

Abstract

In a scenario characterized by a continuous growth of air transportation demand, the runways of large airports serve hundreds of aircraft every day. Aircraft sequencing is a challenging problem that aims to increase runway capacity in order to reduce delays as well as the workload of air traffic controllers. In many cases, the air traffic controllers solve the problem using the simple “first-come-first-serve” (FCFS) rule. In this paper, we present a rolling horizon approach which partitions a sequence of aircraft into chunks and solves the aircraft sequencing problem (ASP) individually for each of these chunks. Some rules for deciding how to partition a given aircraft sequence are proposed and their effects on solution quality investigated. Moreover, two mixed integer linear programming models for the ASP are reviewed in order to formalize the problem, and a tabu search heuristic is proposed for finding solutions to the ASP in a short computation time. Finally, we develop an IRHA which, using different chunking rules, is able to find solutions significantly improving on the FCFS rule for real-world air traffic instances from Milano Linate Airport.
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

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/11573/1571762
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 51
  • ???jsp.display-item.citation.isi??? 44
social impact