Stefan Ravizza email@example.com
Exploration of the ordering for a sequential airport ground movement algorithm
Ravizza, Stefan; Atkin, Jason A.D.
Jason A.D. Atkin firstname.lastname@example.org
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.
Ravizza, S., & Atkin, J. A. Exploration of the ordering for a sequential airport ground movement algorithm. School of Computer Science
|Deposit Date||Oct 28, 2011|
|Copyright Statement||Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf|
|Additional Information||Presented at the International Conference on Operations Research (OR 2011), Zurich, Switzerland, 2011.|
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf
You might also like
Linear Power Flow Characterization of DC Power Distribution Systems for More Electric Aircraft Optimization
Optimal Power Flow Based Architecture Design for Electrical Power System in More-Electric Aircraft
Scheduling airline reserve crew using a probabilistic crew absence and recovery model