EconPapers    
Economics at your fingertips  
 

Aircraft Flow Management under Congestion

G. Andreatta and G. Romanin-Jacur
Additional contact information
G. Andreatta: University of Padova, Padova, Italy
G. Romanin-Jacur: University of Padova, Padova, Italy

Transportation Science, 1987, vol. 21, issue 4, 249-253

Abstract: Airport congestion is one of the main causes of costly aircraft delays. Sometimes costs may be reduced by imposing on some aircraft a delay at take off time in order to later avoid a more expensive airborne delay. The objective of the Flow Management Problem (F.M.P.) is to find an optimal delay strategy so that the total expected delay cost is minimized. In this paper an idealized and greatly simplified version of F.M.P. is investigated. In particular the airways network considered is star-shaped and congestion is allowed only in the central (arrival) airport. For this particular version a model is presented and a polynomial solution algorithm is derived. Landing priorities among aircraft can also influence the total expected delay cost: the optimal priority rule for our version of the F.M.P. is derived. Another algorithm is presented for the case where the number of aircraft not to be delayed on the ground is given a priori. Possible extensions of the proposed model to more realistic situations are mentioned.

Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.21.4.249 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:21:y:1987:i:4:p:249-253

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

 
Page updated 2025-03-19
Handle: RePEc:inm:ortrsc:v:21:y:1987:i:4:p:249-253