Flow Control of Congested Networks pp 323-339 | Cite as
A Combinatorial Optimization Approach to Aircraft Sequencing Problem
Abstract
In this paper a combinatorial optimization approach to aircraft sequencing problem is proposed. In particular the single runway case, with the hypotesis that airplanes wait to land at different times, is considered.
It is shown that the problem of maximizing the runway utilization can be modeled as a n job-one machine scheduling problem with non zero ready times, sequence dependent processing times, and with the objective of minimizing the maximum completion time.
A solution algorithm is outlined and tested by various examples and the computational results are discussed.
Implementation issues are also considered and suggestions on how improve the algorithm performances are made.
Keywords
Dynamic Programming Approach Maximum Completion Time Terminal Area Approach Path Asymmetric Travel Salesman ProblemPreview
Unable to display preview. Download preview PDF.
References
- Bianco L., Nicoletti B., Ricciardelli S. (1987). An algorithm for optimal sequencing of aircraft in the near terminal area. Optimization techniques (Stoer J. ed.). Lecture Notes in Control and Information Science: 443–453, Springer-Verlag.Google Scholar
- Bianco L., Ricciardelli S., Rinaldi G., Sassano A. (1979). The aircraft optimal sequencing as a N job-one machine scheduling problem R 79–36. Istituto di Automatica — Università di Roma and CSSCCA — CNR.Google Scholar
- Bianco L., Ricciardelli S., Rinaldi G., Sassano A. (1985). Sequencing tasks with sequence dependent processing times. TIMS XXVI International Meeting, Copenhagen, R. 120 IASI-CNR Rome.Google Scholar
- Dear R.G. (1976). The dynamic scheduling of aircraft in the near terminal area. FTL R 76.9. Flight Transportation Laboratory, MIT, Cambridge, Massachussets.Google Scholar
- Odoni A.R. (1969). An analytical investigation of air traffic in the vicinity of terminal areas. Technical Report No. 46, Operations Research Center, MIT, Cambridge, Massachussets.Google Scholar
- Pardee R.S. An application of dynamic programming to optimal scheduling in a terminal area air traffic control system. TRW Computers Company.Google Scholar
- Park S.K., Straeter T.A., Hogge J.E. (1972). An analytic study of near terminal area optimal sequencing and flow control techniques. 14th Meeting of the Agard Guidance and Control Panel, Edinburgh, Agard CP 105: 12–1 – 12–18.Google Scholar
- Park S.K., Straeter T.A. (1973). Near terminal area optimal sequencing and flow control as a mathematical programming problem. Mathematical Programming Society, Sumposium on Non-linear Programming, George Washington University.Google Scholar
- Psaraftis H.N. (1978). A dynamic programming approach to the aircraft sequencing problem. FTL R 78–4, Flight Transportation Laboratory, MIT, Cambridge, Massachussets.Google Scholar
- Psaraftis H.N. (1980). A dynamic programming approach for sequencing group of identical jobs. Ops. Res. 6: 1347–1359.MathSciNetCrossRefGoogle Scholar
- Tobias L. (1972). Automated aircraft scheduling methods in the near terminal area. AIAA Paper No. 72–120.Google Scholar
- Trivizas D. (1985). Optimization of runway operations. Working paper. Flight Transportation Laboratory, MIT, Cambridge, Massachussets.Google Scholar