Skip to main content Accessibility help
×
Home

ROUTING OF AIRPLANES TO TWO RUNWAYS: MONOTONICITY OF OPTIMAL CONTROLS

  • N. Bäuerle (a1), O. Engelhardt-Funke (a2) and M. Kolonko (a2)

Abstract

We consider the problem of routing incoming airplanes to two runways of an airport. Due to air turbulence, the necessary separation time between two successive landing operations depends on the type of airplane. When viewed as a queuing problem, this means that we have dependent service times. The aim is to minimize the waiting times of aircrafts. We consider here a model in which arrivals form a stochastic process and the decision-maker does not know anything about future arrivals. We formulate this as a problem of stochastic dynamic programming and investigate the monotonicity of optimal routing strategies with respect to the workload of the runways, for example. We show that an optimal strategy is monotone (i.e., of switching type) only in a restricted case where decisions depend on the state of the runways only and not on the type of the arriving aircraft. Surprisingly, in the more realistic case where this type is also known to the decision-maker, monotonicity need not hold.

Copyright

References

Hide All

REFERENCES

Altman, E. & Stidham, S., Jr. (1995). Optimality of monotonic policies for two-action Markovian decision processes, with applications to control of queues with delayed information. Queueing Systems 21: 267291.
Bäuerle, N., Engelhardt-Funke, O., & Kolonko, M. (2002). Routing of airplanes to two runways: Stability and bounds for the waiting times, submitted.
Beasley, J.E., Krishnamoorty, M., Sharaiha, Y.M., & Abramson, D. (2000). Scheduling aircraft landings—The static case. Transportation Science 34: 180197.
Bertsekas, D. (1987). Dynamic programming: Deterministic and stochastic models. Englewood Cliffs, NJ: Prentice-Hall.
Bertsekas, D. & Tsitsiklis, J.N. (1996). Neuro-dynamic programming. Englewood Cliffs, NJ: Prentice-Hall.
Bolender, M.A. & Slater, G.L. (2000). Evaluation of scheduling methods for multiple runways. Journal of Aircrafts 37: 410416.
Hordijk, A., Koole, G.M., & Loeve, J.A. (1994). Analysis of a customer assignment model with no state information. Probability in the Engineering and Information Sciences 8: 419429.
Horonjeff, R. & McKelvey, F.X. (1994). Planning and design of airports, 4th ed. Boston: McGraw-Hill.
Neuts, M.F. (1977). Some explicit formulas for the steady-state behaviour of the queue with semi-Markovian service times. Advances in Applied Probability 9: 141157.
Puterman, M.L. (1994). Markov decision processes. Discrete stochastic dynamic programming. Wiley Series in Probability and Mathematical Statistics. New York: Wiley.
Schäl, M. (1975). Conditions for the optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 32: 179196.
Stidham, S., Jr. & Weber, R. (1993). A survey of Markov decision models for control of networks of queues. Queueing Systems 13: 291314.

ROUTING OF AIRPLANES TO TWO RUNWAYS: MONOTONICITY OF OPTIMAL CONTROLS

  • N. Bäuerle (a1), O. Engelhardt-Funke (a2) and M. Kolonko (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed