To main content

The Path&Cycle formulation for the Hotspot Problem in Air Traffic Management

The Path&Cycle formulation for the Hotspot Problem in Air Traffic Management

Category
Part of a book/report
Abstract
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.
Client
  • Norges forskningsråd / 267554
Language
English
Affiliation
  • SINTEF Digital / Mathematics and Cybernetics
Year
2018
Published in
OpenAccess Series in Informatics
ISSN
2190-6807
Place
Saarbrücken/Wadern, Germany
Publisher
Dagstuhl Publishing
Book
18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018), August 23–24, 2018, Helsinki, Finland
Booklet
.
ISBN
978-3-95977-096-5