== Abstract ==

​

International audience; To sustain the rapidly increasing air traffic demand, the future air traffic management system will rely on a concept, called Trajectory-Based Operations (TBO), that will require aircraft to follow an assigned 4D trajectory (time-constrained trajectory) with high precision. TBO involves separating aircraft via strategic (long-term) trajectory deconfliction rather than the currently-practicing tactical (short-term) conflict resolution. In this context, this chapter presents a strategic trajectory planning approach aiming at minimizing the number of conflicts between aircraft trajectories for a given day. The proposed methodology allocates an alternative departure time, a horizontal flight path, and a flight level to each aircraft at a nation-wide scale.In real-life situations, aircraft may arrive at a given position with some uncertainties on its curvilinear abscissa due to external events. To ensure robustness of the strategic trajectory plan, the aircraft arrival time to any given position will be represented here by a probabilistic distribution over its nominal assigned arrival time.The proposed approach optimizes the 4D trajectory of each aircraft so as to minimize the probability of potential conflicts between trajectories. A hybrid-metaheuristic optimization algorithm has been developed to solve this large-scale mixed-variable optimization problem. The algorithm is implemented and tested with real air traffic data taking into account uncertainty over the French airspace for which a conflict-free and robust 4D trajectory plan is produced.

​

​

== Original document ==

​

The different versions of the original document can be found in:

​

* [http://hdl.handle.net/20.500.12210/23861 http://hdl.handle.net/20.500.12210/23861] under the license http://hal.archives-ouvertes.fr/licences/copyright/

​

* [https://hal-enac.archives-ouvertes.fr/hal-01478322/file/hybridMetaheuristicForATM.pdf https://hal-enac.archives-ouvertes.fr/hal-01478322/file/hybridMetaheuristicForATM.pdf]

​

* [https://hal.inria.fr/hal-01654699 https://hal.inria.fr/hal-01654699]

​

* [http://link.springer.com/content/pdf/10.1007/978-3-319-58253-5.pdf http://link.springer.com/content/pdf/10.1007/978-3-319-58253-5.pdf],

: [http://link.springer.com/content/pdf/10.1007/978-3-319-58253-5 http://link.springer.com/content/pdf/10.1007/978-3-319-58253-5],

: [http://dx.doi.org/10.1007/978-3-319-58253-5 http://dx.doi.org/10.1007/978-3-319-58253-5]

​

* [http://link.springer.com/content/pdf/10.1007/978-3-319-58253-5_14 http://link.springer.com/content/pdf/10.1007/978-3-319-58253-5_14],

: [http://dx.doi.org/10.1007/978-3-319-58253-5_14 http://dx.doi.org/10.1007/978-3-319-58253-5_14] under the license http://www.springer.com/tdm

​

* [https://hal-enac.archives-ouvertes.fr/hal-01478322 https://hal-enac.archives-ouvertes.fr/hal-01478322],

: [https://hal-enac.archives-ouvertes.fr/hal-01478322/document https://hal-enac.archives-ouvertes.fr/hal-01478322/document],

: [https://hal-enac.archives-ouvertes.fr/hal-01478322/file/hybridMetaheuristicForATM.pdf https://hal-enac.archives-ouvertes.fr/hal-01478322/file/hybridMetaheuristicForATM.pdf] under the license http://www.springer.com/tdm

​

* [https://hal-enac.archives-ouvertes.fr/hal-01478322/document https://hal-enac.archives-ouvertes.fr/hal-01478322/document],

: [https://link.springer.com/chapter/10.1007/978-3-319-58253-5_14 https://link.springer.com/chapter/10.1007/978-3-319-58253-5_14],

: [https://hal-enac.archives-ouvertes.fr/hal-01478322 https://hal-enac.archives-ouvertes.fr/hal-01478322],

: [https://academic.microsoft.com/#/detail/2596948206 https://academic.microsoft.com/#/detail/2596948206] under the license http://hal.archives-ouvertes.fr/licences/copyright/

​

* [https://hal.inria.fr/hal-01654699 https://hal.inria.fr/hal-01654699],

: [https://library.universitaspertamina.ac.id/index.php?p=show_detail&id=4396 https://library.universitaspertamina.ac.id/index.php?p=show_detail&id=4396],

: [https://academic.microsoft.com/#/detail/2754021078 https://academic.microsoft.com/#/detail/2754021078]

​

​

​

​

​

DOIS: 10.1007/978-3-319-58253-5 10.1007/978-3-319-58253-5_14 10.1007/978-3-319-58253-514

​