4.7 Article

Disjunctive linear separation conditions and mixed-integer formulations for aircraft conflict resolution

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 296, Issue 2, Pages 520-538

Publisher

ELSEVIER
DOI: 10.1016/j.ejor.2021.03.059

Keywords

Global optimisation; Mixed-integer nonlinear programming; Convex relaxation; Conflict resolution; Air traffic control

Ask authors/readers for more resources

This study introduces new mixed-integer programming formulations for aircraft conflict resolution with speed, heading, and altitude control based on disjunctive linear separation conditions. The proposed method significantly outperforms existing benchmarks in terms of runtime and the ability to solve more instances to global optimality.
We address the aircraft conflict resolution problem in air traffic control. We introduce new mixed-integer programming formulations for aircraft conflict resolution with speed, heading and altitude control which are based on disjunctive linear separation conditions. We first examine the two-dimensional aircraft conflict resolution problem with speed and heading control represented as continuous decision variables. We show that the proposed disjunctive linear separation conditions are equivalent to the classical nonlinear conditions for aircraft separation. Further, we characterise conflict-free trajectories based on aircraft velocity bounds and propose a simple pre-processing algorithm to identify aircraft pairs which are either always conflict-free, or which cannot be separated using speed and heading control only. We then incorporate altitude control and propose a lexicographic optimisation formulation that aims to minimise the number of flight level changes before resolving outstanding conflicts via two-dimensional velocity control. The proposed mixed-integer programming formulations are nonconvex, and we propose convex relaxations, decomposition methods and constraint generation algorithms to solve the two-dimensional and lexicographic optimisation formulations to guaranteed optimality. Numerical experiments on four types of conflict resolution benchmarking instances are conducted to test the performance of the proposed mixed-integer formulations. Further, the proposed method is compared against two benchmarks based on state-of-the-art approaches for the aircraft conflict resolution problem. Our numerical results show that the proposed method largely outperforms both benchmarks in terms of runtime and is able to solve significantly more instances to global optimality. (c) 2021 Published by Elsevier B.V.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available