Exploration of the ordering for a sequential airport ground movement algorithm

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 effectiven...

Full description

Bibliographic Details
Main Authors: Ravizza, Stefan, Atkin, Jason A.D.
Format: Monograph
Published: School of Computer Science 2011
Online Access:https://eprints.nottingham.ac.uk/1543/
_version_ 1848790627030925312
author Ravizza, Stefan
Atkin, Jason A.D.
author_facet Ravizza, Stefan
Atkin, Jason A.D.
author_sort Ravizza, Stefan
building Nottingham Research Data Repository
collection Online Access
description 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.
first_indexed 2025-11-14T18:15:37Z
format Monograph
id nottingham-1543
institution University of Nottingham Malaysia Campus
institution_category Local University
last_indexed 2025-11-14T18:15:37Z
publishDate 2011
publisher School of Computer Science
recordtype eprints
repository_type Digital Repository
spelling nottingham-15432020-05-04T20:23:06Z https://eprints.nottingham.ac.uk/1543/ Exploration of the ordering for a sequential airport ground movement algorithm Ravizza, Stefan Atkin, Jason A.D. 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. School of Computer Science 2011-10 Monograph NonPeerReviewed 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)
spellingShingle Ravizza, Stefan
Atkin, Jason A.D.
Exploration of the ordering for a sequential airport ground movement algorithm
title Exploration of the ordering for a sequential airport ground movement algorithm
title_full Exploration of the ordering for a sequential airport ground movement algorithm
title_fullStr Exploration of the ordering for a sequential airport ground movement algorithm
title_full_unstemmed Exploration of the ordering for a sequential airport ground movement algorithm
title_short Exploration of the ordering for a sequential airport ground movement algorithm
title_sort exploration of the ordering for a sequential airport ground movement algorithm
url https://eprints.nottingham.ac.uk/1543/