Islami et al 2016a - Revision history

Scipediacontent at 23:27, 1 February 2021

2021-02-01T23:27:56Z

Scipediacontent at 14:25, 21 January 2021

2021-01-21T14:25:16Z

Scipediacontent: Scipediacontent moved page Draft Content 650034094 to Islami et al 2016a

2020-10-14T14:14:53Z

Scipediacontent moved page Draft Content 650034094 to Islami et al 2016a

Scipediacontent: Created page with " == Abstract == International audience To sustain the continuously increasing air traffic demand, the future air traffic management system will rely on a so-called trajector..."

2020-10-14T14:14:50Z

Created page with " == Abstract == International audience To sustain the continuously increasing air traffic demand, the future air traffic management system will rely on a so-called trajector..."

New page

== Abstract ==

International audience To sustain the continuously increasing air traffic demand, the future air traffic management system will rely on a so-called trajectory based operations concept that will increase air traffic capacity by reducing the controllers workload. This will be achieved by transferring tactical conflict detection and resolution tasks to the strategic planning phase. In this future air traffic management paradigm context, this paper presents a methodology to address such trajectory planning at nation-wide and continent scale. The pro-posed methodology aims at minimizing the global interaction between aircraft trajectories by allocating alternative departure times, alternative horizontal flight paths, and alternative flight levels to the trajectories involved in the interaction. To improve robustness of the strategic trajectory planning, un-certainty of aircraft position and aircraft arrival time to any given position on the trajectory are considered. This paper presents a mathematical formulation of this strategic trajectory planning problem leading to a mixed-integer optimization problem, whose objective function relies on the new concept of interaction between trajectories. A computationally efficient algorithm to compute interaction between trajectories for large-scale applications is presented and implemented. Resolution method based on hybrid-metaheuristic algorithm have been developed to solve the above large-scale optimization problems. Finally, the overall methodology is implemented and tested with real air traffic data taking into account uncertainty over the French and the European airspace, involving more than 30,000 trajectories. Conflict-free and robust 4D trajectory planning are produced within computational time acceptable for the operation context, which shows the viability of the approach.

Document type: Part of book or chapter of book

== Full document ==
<pdf>Media:Draft_Content_650034094-beopen966-7333-document.pdf</pdf>

== Original document ==

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

* [https://hal-enac.archives-ouvertes.fr/hal-01343591/file/Large%20scale%204D%20trajectory%20planning%20Rev.pdf https://hal-enac.archives-ouvertes.fr/hal-01343591/file/Large%20scale%204D%20trajectory%20planning%20Rev.pdf]

← Older revision		Revision as of 23:27, 1 February 2021
Line 2:		Line 2:
	== Abstract ==		== Abstract ==

−	International audience; To sustain the continuously increasing air traffic demand, the future air traffic management system will rely on a so-called trajectory based operations concept that will increase air traffic capacity by reducing the ~~controllersâ~~ workload. This will be achieved by transferring tactical conflict detection and resolution tasks to the strategic planning phase. In this future air traffic management paradigm context, this paper presents a methodology to address such trajectory planning at nation-wide and continent scale. The pro-posed methodology aims at minimizing the global interaction between aircraft trajectories by allocating alternative departure times, alternative horizontal flight paths, and alternative flight levels to the trajectories involved in the interaction. To improve robustness of the strategic trajectory planning, un-certainty of aircraft position and aircraft arrival time to any given position on the trajectory are considered. This paper presents a mathematical formulation of this strategic trajectory planning problem leading to a mixed-integer optimization problem, whose objective function relies on the new concept of interaction between trajectories. A computationally efficient algorithm to compute interaction between trajectories for large-scale applications is presented and implemented. Resolution method based on hybrid-metaheuristic algorithm have been developed to solve the above large-scale optimization problems. Finally, the overall methodology is implemented and tested with real air traffic data taking into account uncertainty over the French and the European airspace, involving more than 30,000 trajectories. Conflict-free and robust 4D trajectory planning are produced within computational time acceptable for the operation context, which shows the viability of the approach.	+	International audience; To sustain the continuously increasing air traffic demand, the future air traffic management system will rely on a so-called trajectory based operations concept that will increase air traffic capacity by reducing the controllers’ workload. This will be achieved by transferring tactical conflict detection and resolution tasks to the strategic planning phase. In this future air traffic management paradigm context, this paper presents a methodology to address such trajectory planning at nation-wide and continent scale. The pro-posed methodology aims at minimizing the global interaction between aircraft trajectories by allocating alternative departure times, alternative horizontal flight paths, and alternative flight levels to the trajectories involved in the interaction. To improve robustness of the strategic trajectory planning, un-certainty of aircraft position and aircraft arrival time to any given position on the trajectory are considered. This paper presents a mathematical formulation of this strategic trajectory planning problem leading to a mixed-integer optimization problem, whose objective function relies on the new concept of interaction between trajectories. A computationally efficient algorithm to compute interaction between trajectories for large-scale applications is presented and implemented. Resolution method based on hybrid-metaheuristic algorithm have been developed to solve the above large-scale optimization problems. Finally, the overall methodology is implemented and tested with real air traffic data taking into account uncertainty over the French and the European airspace, involving more than 30,000 trajectories. Conflict-free and robust 4D trajectory planning are produced within computational time acceptable for the operation context, which shows the viability of the approach.

@@ Line 2: / Line 2: @@
 == Abstract ==
-International audience  To sustain the continuously increasing air traffic demand, the future air traffic management system will rely on a so-called trajectory based operations concept that will increase air traffic capacity by reducing the controllers workload. This will be achieved by transferring tactical conflict detection and resolution tasks to the strategic planning phase. In this future air traffic management paradigm context, this paper presents a methodology to address such trajectory planning at nation-wide and continent scale. The pro-posed methodology aims at minimizing the global interaction between aircraft trajectories by allocating alternative departure times, alternative horizontal flight paths, and alternative  flight levels to the trajectories involved in the interaction. To improve robustness of the strategic trajectory planning, un-certainty of aircraft position and aircraft arrival time to any given position on the trajectory are considered. This paper presents a mathematical formulation of this strategic trajectory planning problem leading to a mixed-integer optimization problem, whose objective function relies on the new concept of interaction between trajectories. A computationally efficient algorithm to compute interaction between trajectories for large-scale applications is presented and implemented. Resolution method based on hybrid-metaheuristic algorithm have been developed to solve the above large-scale optimization problems. Finally, the overall methodology is implemented and tested with real air traffic data taking into account uncertainty over the French and the European airspace, involving more than 30,000 trajectories. Conflict-free and robust 4D trajectory planning are produced within computational time acceptable for the operation context, which shows the viability of the approach.
+International audience; To sustain the continuously increasing air traffic demand, the future air traffic management system will rely on a so-called trajectory based operations concept that will increase air traffic capacity by reducing the controllersâ workload. This will be achieved by transferring tactical conflict detection and resolution tasks to the strategic planning phase. In this future air traffic management paradigm context, this paper presents a methodology to address such trajectory planning at nation-wide and continent scale. The pro-posed methodology aims at minimizing the global interaction between aircraft trajectories by allocating alternative departure times, alternative horizontal flight paths, and alternative flight levels to the trajectories involved in the interaction. To improve robustness of the strategic trajectory planning, un-certainty of aircraft position and aircraft arrival time to any given position on the trajectory are considered. This paper presents a mathematical formulation of this strategic trajectory planning problem leading to a mixed-integer optimization problem, whose objective function relies on the new concept of interaction between trajectories. A computationally efficient algorithm to compute interaction between trajectories for large-scale applications is presented and implemented. Resolution method based on hybrid-metaheuristic algorithm have been developed to solve the above large-scale optimization problems. Finally, the overall methodology is implemented and tested with real air traffic data taking into account uncertainty over the French and the European airspace, involving more than 30,000 trajectories. Conflict-free and robust 4D trajectory planning are produced within computational time acceptable for the operation context, which shows the viability of the approach.
-−
-Document type: Part of book or chapter of book
-−
-== Full document ==
-<pdf>Media:Draft_Content_650034094-beopen966-7333-document.pdf</pdf>
@@ Line 15: / Line 10: @@
 * [https://hal-enac.archives-ouvertes.fr/hal-01343591/file/Large%20scale%204D%20trajectory%20planning%20Rev.pdf https://hal-enac.archives-ouvertes.fr/hal-01343591/file/Large%20scale%204D%20trajectory%20planning%20Rev.pdf]

← Older revision	Revision as of 14:14, 14 October 2020
(No difference)