Advanced Search
MyIDEAS: Login to save this article or follow this journal

An Integrated Simulation and Dynamic Programming Approach for Determining Optimal Runway Exit Locations


Author Info

  • Hanif D. Sherali

    (Department of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061-0118)

  • Antoine G. Hobeika

    (Transportation Research Center, 106 Faculty Street, Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061-0118)

  • Antonio A. Trani

    (Transportation Research Center, 106 Faculty Street, Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061-0118)

  • Byung J. Kim

    (Transportation Research Center, 106 Faculty Street, Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061-0118)

Registered author(s):


    The Federal Aviation Administration and National Aeronautics and Space Administration are researching several problems targeted at improving airport capacity. Among the foremost of these problems is the issue of improving the operational use of runways. The efficiency of runway usage is dictated primarily by the runway occupancy time (ROT) which is the time that an aircraft spends on the runway or its vicinity, until a new arrival or departure can be processed on this runway. This paper considers the problem of determining the geometry and location of high speed exits on a runway to minimize the weighted ROT of a population of aircraft under various landing scenarios and frequencies of usage. Both the problem of designing a new runway and modifying an existing one are addressed. It is shown that the continuous location problem of siting runway turnoffs admits a natural finite set of candidate optimal locations. To characterize problem data and determine optimal exit locations, a simulation program integrated with a polynomial-time dynamic programming algorithm is developed. The methodology has been implemented on a personal computer, and an example is presented to illustrate the approach.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL:
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 38 (1992)
    Issue (Month): 7 (July)
    Pages: 1049-1062

    as in new window
    Handle: RePEc:inm:ormnsc:v:38:y:1992:i:7:p:1049-1062

    Contact details of provider:
    Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Web page:
    More information through EDIRC

    Related research

    Keywords: runway design; runway occupancy time; optimal location; dynamic programming; simulation;


    No references listed on IDEAS
    You can help add them by filling out this form.


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Hancerliogullari, Gulsah & Rabadi, Ghaith & Al-Salem, Ameer H. & Kharbeche, Mohamed, 2013. "Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem," Journal of Air Transport Management, Elsevier, vol. 32(C), pages 39-48.


    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:38:y:1992:i:7:p:1049-1062. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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