Abstract
The annual number of flights in Western Europe has increased from about 2.6 million in 1982 to about 4.5 million in 1992, an increase of 73%. Acute congestion of the Air Traffic Control system has been the result. One way to reduce this congestion is to modify the flight plans (slot of departure and route) in order to adapt the demand to the available capacity. This paper addresses the general time-route assignment problem. A state of the art of the existing methods shows that this problem is usually partially treated and the whole problem remains unsolved due to the complexity induced.
We perform our research on the application of stochastic methods on real traffic data, and without using the flow network concept, but by simulating the flight of each aircraft. The first results shows that our Genetic Algorithms based method is able to reduce congestion of the french airspace by a factor 2. Special coding techniques and operators are used to improve the quality of the genetic search.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M Ben-Akiva, A DePalma, and I Kaysi. Dynamic network models and driver information systems. Transportation Research, 25A(5):251–266, 1991.
D.J Bertsimas and S Stock. The air traffic flow management problem with en-route capacities. Technical report, A.P Sloan School of Management. M.I.T, 1994.
E Cascetta and G.E Cantarella. A day-to-day and within-day dynamic stochastic assignment model. Transportation Research, 25A(5):277–291, 1991.
R Cerf. Une Théorie Asymptotique des Algorithmes Génétiques. PhD thesis, Université Montpellier II (France), 1994.
S Dafermos and F.T Sparrow. The traffic assignment problem for a general network. Journal of Research of the National Bureau of Standards, 73B:91–118, 1969.
D Delahaye and A.R Odoni. Airspace congestion smoothing by stochastic optimization. In Proceedings of the Sixth International Conference on Evolutionary Programming. Natural Selection inc., 1997.
T.L Friesz, D Bernstein, T.E Smith, and B.W Wie. A variational inequality formulation of the dynamic network user equilibrium problem. Operations Research, 41(1):179–191, 1993.
T.L Friesz, J Luque, R.L Tobin, and B.W Wie. Dynamic network traffic assignment considered as a continuous time optimal control problem. Operation Research, 37(6):893–901, 1989.
D.E Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Reading MA Addison Wesley, 1989.
Z Michalewicz. Genetic algorithms + Data Structures = Evolution Programs. Springer-verlag, 1992.
A.R Odoni. The flow management problem in air traffic control. In A.R Odoni et al, editor, Flow Control of Congested Networks, volume F38 of ASI Series, pages 269–288. NATO, 1987.
M. Papageorgiou. Concise encyclopedia of traffic and transportation systems. Pergamon Press, 1991.
P Vranas, D Bertsimas, and A.R Odoni. The multi-airport ground-holding problem in air traffic control. Operation Research, 42(2):249–261, 1994.
D.J Zawack and G.L Thompson. A dynamic space-time network flow model for city traffic congestion. Transportation Science, 21(3):153–162, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oussedik, S., Delahaye, D. (1998). Reduction of air traffic congestion by genetic algorithms. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056927
Download citation
DOI: https://doi.org/10.1007/BFb0056927
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65078-2
Online ISBN: 978-3-540-49672-4
eBook Packages: Springer Book Archive