IDEAS home Printed from https://ideas.repec.org/a/ids/ijidsc/v3y2011i4p372-391.html
   My bibliography  Save this article

A maximum-entropy approach to minimising resource contention in aircraft routing for optimisation of airport surface operations

Author

Listed:
  • H-S. Jacob Tsao
  • Agus Pratama

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.

Suggested Citation

  • H-S. Jacob Tsao & Agus Pratama, 2011. "A maximum-entropy approach to minimising resource contention in aircraft routing for optimisation of airport surface operations," International Journal of Information and Decision Sciences, Inderscience Enterprises Ltd, vol. 3(4), pages 372-391.
  • Handle: RePEc:ids:ijidsc:v:3:y:2011:i:4:p:372-391
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=43028
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijidsc:v:3:y:2011:i:4:p:372-391. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=306 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.