Improved rolling horizon approaches to the aircraft sequencing problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Scheduling Année : 2015

Improved rolling horizon approaches to the aircraft sequencing problem

Résumé

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.
Fichier non déposé

Dates et versions

hal-01273501 , version 1 (12-02-2016)

Identifiants

Citer

Fabio Furini, Martin Philip Kidd, Carlo Alfredo Persiani, Paolo Toth. Improved rolling horizon approaches to the aircraft sequencing problem. Journal of Scheduling, 2015, 18 (5), ⟨10.1007/s10951-014-0415-8⟩. ⟨hal-01273501⟩
140 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More