Pruning rules for optimal runway sequencing

de Maere, Geert, Atkin, Jason and Burke, Edmund (2017) Pruning rules for optimal runway sequencing. Transportation Science . ISSN 1526-5447

Full text not available from this repository.


This paper investigates runway sequencing for real world scenarios at one of the world's busiest airports, London Heathrow. Several pruning principles are introduced that enable significant reductions of the problem's average complexity, without compromising the optimality of the resulting sequences, nor compromising the modelling of important real world constraints and objectives. The pruning principles are generic and can be applied in a variety of heuristic, meta-heuristic or exact algorithms. They could also be applied to different runway configurations, as well as to different variants of the machine scheduling problem with sequence dependent setup times, the generic variant of the runway sequencing problem in this paper. They have been integrated into a dynamic program for runway sequencing, which has been shown to be able to generate optimal sequences for large scale problems at an extremely low computational cost, whilst considering complex non-linear and non-convex objective functions that offer significant flexibility to model real world preferences and real world constraints. The results shown here counter the proliferation of papers that claim that runway sequencing problems are too complex to solve exactly and therefore attempt to solve them heuristically.

Item Type: Article
Keywords: Dynamic programming, Runway Sequencing, Machine Scheduling, Sequence dependent setup times
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number:
Depositing User: Eprints, Support
Date Deposited: 20 Oct 2016 09:48
Last Modified: 04 May 2020 19:10

Actions (Archive Staff Only)

Edit View Edit View