Abstract
In this paper, models and algorithms for real-time control of the TMA are proposed. We consider two cases: in the first one (static) we assume that there is a set of aircraft to be sequenced for which we know in advance their entry time in the terminal area; in the second one (dynamic), the entry times of future aircraft are unknown and the sequence of aircraft is recomputed whenever a new aircraft approaches the terminal area. For the static case, we model the sequencing problem as a Cumulative Traveling Salesman Problem with Ready Times and propose two lower bounds for testing heuristic solutions. For the dynamic case, where only a limited knowledge of the arrivals is assumed, we add to the basic model a set of constraints which allow the controller to maintain given patterns of the landing sequences previously generated. For both cases, heuristic algorithms are proposed and computational results are discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
G. Andreatta, G. Romanin-Jacur, Aircraft flow management under congestion, Trans. Science, 21, 249–253, 1987.
L. Bianco and M. Bielli, System Aspects and Optimization Models in ATC Planning, in: L. Bianco, A. R. Odoni (Eds.), Large Scale Computation and Information Processing in Air Traffic Control, Springer Verlag, 47-99, 1993.
L. Bianco, P. Dell’Olmo and G. Giordani, One machine scheduling with ready times and sequence dependent processing times: preliminary results, Report 408, IASI-CNR, Rome, 1995.
L. Bianco, A. Mingozzi and S. Ricciardelli, The Traveling Salesman Problem with Cumulative Costs, Networks, 23, 81–91, 1993.
L. Bianco, G. Rinaldi and A. Sassano, Scheduling tasks with sequencedependent processing times, Naval Res. Log., 35, 177–184, 1988.
N. Christofides, A. Mingozzi and P. Toth, State space relaxation for the computation of bounds to routing problems, Networks, 11, 145–164, 1981.
R. G. Dear, The Dynamic Scheduling of Aircraft in the Near Terminal Area, FLT R76.9, Flight Transportation Laboratory, M.I.T., Cambridge, 1976.
M. Fischetti, G. Laporte and S. Martello, The delivery man problem and cumulative matroids, Opns. Res., 41, 1055–1064, 1993.
M. Held, P. Wolfe and H.P. Crowder, Validation of subgradient optimization, Math. Prog., 6, 62–88, 1974.
R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling theory: a survey, Ann. Discrete Math., 5, 287–326, 1979.
H. N. Psaraftis, A Dynamic Programming Approach to the Aircraft Sequencing Problem, FTL R78-4, Flight Transportation Laboratory, M.I.T., Cambridge, 1978.
H. N. Psaraftis, A dynamic Programming Approach for Sequencing Identical Groups of Jobs, Opns. Res., 28, 1347–1359, 1980
J.-C. Picard and M. Queyranne, The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling, Opns. Res., 26, 86–110, 1978.
A.H.G. Rinnooy Kan, Machine scheduling problems: classification, complexity and computations, Martinus Nijhoff, The Hague, Netherlands, 1976.
W.E. Schrage, A proof of the optimality of the shortest remaining processing time discipline, Opns. Res., 16, 687–690, 1968.
C.S. Venkatakrishnan, A. Barnett and A.M. Odoni, Landings at Logan Airport: Describing and Increasing Airport Capacity, Transp. Sci., 27, 211–227, 1993
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bianco, L., Dell’Olmo, P., Giordani, S. (1997). Scheduling Models and Algorithms for TMA Traffic Management. In: Bianco, L., Dell’Olmo, P., Odoni, A.R. (eds) Modelling and Simulation in Air Traffic Management. Transportation Analysis. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60836-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-60836-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64576-1
Online ISBN: 978-3-642-60836-0
eBook Packages: Springer Book Archive