|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|Title:||Heuristic search for the coupled runway sequencing and taxiway routing problem|
Burke, Edmund K
|Keywords:||Runway arrival and departure sequencing|
|Citation:||Benlic U, Brownlee A & Burke EK (2016) Heuristic search for the coupled runway sequencing and taxiway routing problem, Transportation Research Part C: Emerging Technologies, 71, pp. 333-355.|
|Abstract:||This paper presents the first local search heuristic for the coupled runway sequencing (arrival & departure) and taxiway routing problems, based on the receding horizon (RH) scheme that takes into account the dynamic nature of the problem. As test case, we use Manchester Airport, the third busiest airport in the UK. From the ground movement perspective, the airport layout requires that departing aircraft taxi across the arrivals runway. This makes it impossible to separate arrival from departure sequencing in practice. Operationally, interactions between aircraft on the taxiways could prevent aircraft from taking off from, or landing on, runways during the slots assigned to them by an algorithm optimizing runway use alone. We thus consider the interactions between arrival and departure aircraft on the airport surface. Compared to sequentially optimized solutions, the results obtained with our approach indicate a significant decrease in the taxiway routing delay, with generally no loss in performance in terms of the sequencing delay for a regular day of operations. Another benefit of such a simultaneous optimization approach is the possibility of holding aircraft at the stands for longer, without the engines running. This significantly reduces the fuel burn, as well as bottlenecks and traffic congestion during peak hours that are often the cause of flight delays due to the limited amount of airport surface space available. Given that the maximum computing time per horizon is around 95 seconds, real-time operation might be practical with increased computing power.|
|Rights:||Copyright 2016 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.