The full text of this article


A maximum-entropy approach to minimising resource contention in aircraft routing for optimisation of airport surface operations
by H-S. Jacob Tsao, Agus Pratama
International Journal of Information and Decision Sciences (IJIDS), Vol. 3, No. 4, 2011


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.

Online publication date: Tue, 11-Oct-2011


is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Decision Sciences (IJIDS):
Login with your Inderscience username and password:


    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email