Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem
详细信息 查看全文
- 作者：Thibault Lehouillier ; a ; b ; thibaultlehouillier@gmail.com" class="auth_mail" title="E-mail the corresponding author ; Jé ; ré ; my Omerc ; jeremy.omer@insa-rennes.fr" class="auth_mail" title="E-mail the corresponding author ; Franç ; ois Soumisa ; b ; Guy Desaulniersa ; b
- 关键词：Air traffic control ; Conflict resolution ; Mixed integer linear optimization ; Minimum weight maximum clique ; Decomposition methods
- 刊名：European Journal of Operational Research
- 出版年：2017
- 出版时间：1 February 2017
- 年：2017
- 卷：256
- 期：3
- 页码：696-712
- 全文大小：1254 K
文摘
- •
We present a minimum-weight maximum-cardinality clique model for the air conflict resolution problem.
- •
The modeling of aircraft, maneuvers and costs are fully separated from the resolution process.
- •
We develop one decomposition method to find a trade-off between solution time and cost.
- •
We develop one decomposition method to exploit the geometry of the instances.
- •
We illustrate the significance of these decompositions on large random instances.