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

详细信息    查看全文

• 作者：Sonia Cafieri¹ ; ^a ; David Rey ; ^b ; ^{d.rey@unsw.edu.au}
• 关键词：Mixed-integer nonlinear programming ; Conflict detection and resolution ; Air traffic control ; Deterministic global optimization ; Modeling
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：April 2017
• 年：2017
• 卷：80
• 期：Complete
• 页码：147-158
• 全文大小：769 K
• 卷排序：80

文摘

Developed speed control-based air conflict avoidance models using MINLP that do not require any form of discretization. We maximize the number of conflicts resolved subject to subliminal speed control constraints. A pre-processing algorithm is presented to reduce the size of the MINLP formulations. A new approach together with a greedy algorithm is proposed to find the largest set of conflict-free aircraft. Results on benchmark instances show that the proposed models and algorithms are efficient and versatile.