Journal Article

A dynamic programming approach for the airport capacity allocation problem

Get access
IMA Journal of Management Mathematics, Volume 14, Issue 3, July 2003, Pages 235–249, https://doi.org/10.1093/imaman/14.3.235
Published:
01 July 2003

Abstract

In most of the optimization models developed to manage airports operations, arrivals and departures capacities are treated as independent variables: that is the number of flights allowed to take off does not affect the number of landings in any unit of time, and vice versa. This assumption is seldom verified in most of the congested airports, where many interactions between arrivals and departures take place.

In this paper, we face the problem of finding the optimal trade‐off between the number of arrivals and departures in order to reduce a delay function of all the flights, using a more realistic representation of the airport capacity, i.e. the capacity envelope.

Under the assumption of piecewise linear convex capacity envelopes and of the exact interpolation of all the Pareto‐optimal operational points, we show that the problem can be formulated as a linear programming model. For general airport capacity envelopes, we propose a dynamic programming formulation with a corresponding backward solution algorithm, which is robust, easy to implement and has a linear computational complexity. The algorithm performances are evaluated on different realistic scenarios, and the optimal solutions are compared with those computed by a greedy algorithm, which can be seen as an approximation of the current decision procedures. The percentage deviation of the cost of these two solutions ranges from 3.98 to 35.64%.

You do not currently have access to this article.
Close
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close

This PDF is available to Subscribers Only

View Article Abstract & Purchase Options

For full access to this pdf, sign in to an existing account, or purchase an annual subscription.

Close

Gift article access

As a benefit of your subscription, you can share temporary access to restricted articles.

Each link will stop working after 30 days or 10 uses. You may create up to 10 links in a 30 day period.

Please sign in to your personal account to gift article access.

Gift article access

Please create a link below to share with others. This will provide temporary access to this restricted article.

The link will stop working after 30 days or 10 uses. You may create up to 10 links in a 30 day period.

Gift articles remaining: --

Gift article access

The link will stop working after 30 days or 10 uses. You may create up to 10 links in a 30 day period.

Gift articles remaining: --

Gift article access

As a benefit of your subscription, you can share temporary access to restricted articles.

Each link will stop working after 30 days or 10 uses.

You have reached the limit of 10 links within a 30 day period