Optimization Online


Complex Number Formulation and Convex Relaxations for Aircraft Conflict Resolution

David Rey (d.rey***at***unsw.edu.au)
Hassan Hijazi (hassan.hijazi***at***anu.edu.au)

Abstract: We present a novel complex number formulation along with tight convex relaxations for the aircraft conflict resolution problem. Our approach combines both speed and heading control and provides global optimality guarantees despite non-convexities in the feasible region. As a side result, we present a new characterization of the conflict separation condition in the form of disjunctive linear constraints. Our formulation features one binary variable per pair of aircraft, is free of trigonometric functions, and captures the non-convexity in a set of quadratic concave constraints. Using our approach, we are able to close a number of open instances and reduce computational time by up to two orders of magnitude on standard instances.

Keywords: Global Optimization, Mixed-integer Nonlinear Programming, Air traffic Management, Convex relaxations, Complex number,

Category 1: Global Optimization (Applications )

Category 2: Applications -- OR and Management Sciences (Airline Optimization )

Category 3: Integer Programming ((Mixed) Integer Nonlinear Programming )

Citation: @article{ReyHijazi_17, year={2017}, month={March}, journal={Technical Report}, title={Complex Number Formulation and Convex Relaxations for Aircraft Conflict Resolution}, author={Rey, David and Hijazi, Hassan}, }

Download: [PDF]

Entry Submitted: 03/20/2017
Entry Accepted: 04/01/2017
Entry Last Modified: 09/18/2017

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society