Skip to Main content Skip to Navigation
Journal articles

Maximizing the number of conflict-free aircraft using mixed-integer nonlinear programming

Abstract : We address the conflict detection and resolution problem in air traffic control, where an aircraft conflict is a loss of separation between aircraft trajectories. Conflict avoidance is crucial to ensure flight safety and remains a challenging traffic control problem. We focus on speed control to separate aircraft and consider two approaches: (i) maximize the number of conflicts resolved and (ii) identify the largest set of conflict-free aircraft. Both problems are modeled using mixed-integer nonlinear programming and a tailored greedy algorithm is proposed for the latter. Computational efficiency is improved through a pre-processing algorithm which attempts to reduce the size of the conflict resolution models by detecting the existence of pairwise potential conflicts. Numerical results are provided after implementing the proposed models and algorithms on benchmark conflict resolution instances. The results highlight the benefits of using the proposed pre-processing step as well as the versatility and the efficiency of the proposed models.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal-enac.archives-ouvertes.fr/hal-01432814
Contributor : Laurence Porte <>
Submitted on : Thursday, January 12, 2017 - 10:36:42 AM
Last modification on : Tuesday, February 11, 2020 - 1:58:44 PM
Document(s) archivé(s) le : Friday, April 14, 2017 - 11:59:35 AM

File

cafieri_rey_COR.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Sonia Cafieri, David Rey. Maximizing the number of conflict-free aircraft using mixed-integer nonlinear programming. Computers and Operations Research, Elsevier, 2017, 80 (April 2017), pp 147-158. ⟨10.1016/j.cor.2016.12.002⟩. ⟨hal-01432814⟩

Share

Metrics

Record views

317

Files downloads

446