文章基本信息

标题：The Path&Cycle Formulation for the Hotspot Problem in Air Traffic Management
本地全文：下载
作者：Carlo Mannino ; Giorgio Sartor
期刊名称：OASIcs : OpenAccess Series in Informatics
电子版ISSN：2190-6807
出版年度：2018
卷号：65
页码：1-11
DOI：10.4230/OASIcs.ATMOS.2018.14
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：The Hotspot Problem in Air Traffic Management consists of optimally rescheduling a set of airplanes that are forecast to occupy an overcrowded region of the airspace, should they follow their original schedule. We first provide a MILP model for the Hotspot Problem using a standard big-M formulation. Then, we present a novel MILP model that gets rid of the big-M coefficients. The new formulation contains only simple combinatorial constraints, corresponding to paths and cycles in an associated disjunctive graph. We report computational results on a set of randomly generated instances. In the experiments, the new formulation consistently outperforms the big-M formulation, both in terms of running times and number of branching nodes.
关键词：Air Traffic Management; Hotspot Problem; Job-shop scheduling; Mixed Integer Linear Programming