Skip to Main content Skip to Navigation
Conference papers

Airspace congestion smoothing by multi-objective genetic algorithm

Abstract : Air traffic control systems become more and more congested due to the increase of demand. One way to reduce this congestion is to modify the flight plans (slot of departure and route of aircraft) in order to adapt the demand to the available capacity. This paper addresses the general time-route assignment problem which can be stated as follows: one has to find an optimal time of departure and an optimal route for all the aircraft involved in the considered airspace, in order to minimize the associated congestion and the induced delay. This problem is a multi-objective NP_Hard problem. We perform our research on the application of multi-objective stochastic methods on real traffic data without using the flow network concept, but by simulating the flight of each aircraft. The first results show that our approach is able to reduce congestion of the French airspace by a factor 2.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal-enac.archives-ouvertes.fr/hal-01004145
Contributor : Laurence Porte <>
Submitted on : Friday, July 11, 2014 - 2:07:55 PM
Last modification on : Wednesday, April 11, 2018 - 11:56:05 AM
Long-term archiving on: : Saturday, October 11, 2014 - 10:36:02 AM

File

Delahaye_SAC2005.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Daniel Delahaye, Sofiane Oussedik, Stéphane Puechmorel. Airspace congestion smoothing by multi-objective genetic algorithm. SAC 2005, 20th Annual ACM Symposium on Applied Computing, Mar 2005, Santa Fe, United States. pp 907-912, ⟨10.1145/1066677.1066887⟩. ⟨hal-01004145⟩

Share

Metrics

Record views

260

Files downloads

905