2026-07-24T12:53:39Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9719 2024-03-06T10:30:27Z ddc:004 open_access

The Path&Cycle Formulation for the Hotspot Problem in Air Traffic Management Mannino, Carlo Sartor, Giorgio Air Traffic Management Hotspot Problem Job-shop scheduling Mixed Integer Linear Programming 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Carlo Mannino and Giorgio Sartor 2018 Is Part Of OASIcs, Volume 65, 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2018.14 urn:nbn:de:0030-drops-97191 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.14 eng https://creativecommons.org/licenses/by/3.0/legalcode