A maximum-entropy approach to minimising resource contention in aircraft routing for optimisation of airport surface operations. (12th October 2011)

• Record Type: Journal Article
• Authors: Tsao, H-S. Jacob; Pratama, Agus
• Is Part Of: International journal of information and decision sciences. Volume 3:Number 4(2011)
• Page Start: 372
• Page End: 391
• Publication Date: 2011-10-12
• Subjects: maximum entropy -- resource contention -- measure -- aircraft routing -- optimal airport surface operations -- optimisation -- information entropy -- aircraft gates -- assigned runways -- aircraft taxiways -- taxiway routing; Decision making -- Periodicals; Decision support systems -- Periodicals; Management science -- Periodicals; 658.40305
• Languages: English
• ISSNs: 1756-7017

Abstract

We propose a new application of information entropy and motivate this application with the problem of routing aircraft between their gates and assigned runways for optimising airport surface operations. In this context, the more clustered (i.e., the less scattered) the scheduled uses of taxiway links, the higher temporal resource contention, which in turn results in higher congestion probability and larger amounts of delays, wasted fuel and emissions. A measure of 'scatteredness' is needed. The connection between such a measure and entropy lies in the fact that the arrival times of the n aircraft that reach a given taxiway link within a given time interval partition the interval into n + 1 subintervals. The n + 1 corresponding subinterval-length proportions constitute a probability distribution, and the entropy of this distribution can be used to measure the scatteredness of the use pattern. Our numerical experience demonstrates the significant advantage of entropy maximisation in aircraft taxiway routing.