Dynamic solution to the ground-holding problem in air traffic control
Existing probabilistic solutions to the ground-holding problem in air traffic control are of a static nature, with ground-holds assigned to aircraft at the beginning of daily operations. In this paper we present an optimal dynamic solution that simplifies the structure of the control mechanism by exercising ground-holding on groups of aircraft instead of individual flights. Using stochastic linear programming with recourse, we have been able to solve problem instances for one of the largest airports in the U.S. with just a powerful PC. We illustrate the advantage of the probabilistic dynamic solution over: (a) the static solution; (b) a deterministic solution; and (c) the passive strategy of no ground-holding.
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 28 (1994)
Issue (Month): 3 (May)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:transa:v:28:y:1994:i:3:p:167-185. 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: (Zhang, Lei)
If references are entirely missing, you can add them using this form.