Exploration of the ordering for a sequential airport ground movement algorithm

Ravizza, Stefan and Atkin, Jason A.D. (2011) Exploration of the ordering for a sequential airport ground movement algorithm. Technical Report. School of Computer Science. (Unpublished)

WarningThere is a more recent version of this item available.
[img] PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (36kB)

Abstract

Guiding aircraft around the airport's surface while ensuring conflict-free routings is an important problem at airports. Sequential routing and scheduling algorithms can be advantageous for providing fast online solutions for decision support systems to help controllers. However, the effectiveness of such algorithms can depend upon the sequence of consideration of the aircraft, which is often chosen to be first-come-first-served. This research analyses the effects of different heuristics to find better sequences. Results are presented, utilising real data from Zurich Airport. These show that sophisticated heuristics can substantially improve the solution with comparatively little additional computational time. Furthermore, one approach aims to modify relatively few existing routes as it progresses, in order to minimise the workload of the controllers in communicating changes in an online environment.

Item Type: Monograph (Technical Report)
Additional Information: Presented at the International Conference on Operations Research (OR 2011), Zurich, Switzerland, 2011.
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Depositing User: Ravizza, Stefan
Date Deposited: 28 Oct 2011 08:12
Last Modified: 28 Oct 2011 08:12
URI: http://eprints.nottingham.ac.uk/id/eprint/1543

Available Versions of this Item

Actions (Archive Staff Only)

Edit View Edit View