dc.contributor.author | Sartor, Giorgio | |
dc.contributor.author | Mannino, Carlo | |
dc.date.accessioned | 2018-09-27T05:41:57Z | |
dc.date.available | 2018-09-27T05:41:57Z | |
dc.date.created | 2018-09-25T12:17:54Z | |
dc.date.issued | 2018 | |
dc.identifier.citation | 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018), August 23–24, 2018, Helsinki, Finland, 14:1-14:11 | nb_NO |
dc.identifier.isbn | 978-3-95977-096-5 | |
dc.identifier.uri | http://hdl.handle.net/11250/2564824 | |
dc.description.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. | nb_NO |
dc.language.iso | eng | nb_NO |
dc.relation.ispartof | 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018), August 23–24, 2018, Helsinki, Finland | |
dc.relation.uri | http://drops.dagstuhl.de/opus/volltexte/2018/9719/pdf/OASIcs-ATMOS-2018-14.pdf | |
dc.rights | Navngivelse 4.0 Internasjonal | * |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/deed.no | * |
dc.title | The Path&Cycle formulation for the Hotspot Problem in Air Traffic Management | nb_NO |
dc.type | Chapter | nb_NO |
dc.description.version | publishedVersion | nb_NO |
dc.source.pagenumber | 14:1-14:11 | nb_NO |
dc.identifier.cristin | 1613333 | |
dc.relation.project | Norges forskningsråd: 267554 | nb_NO |
cristin.unitcode | 7401,90,11,0 | |
cristin.unitname | Anvendt matematikk | |
cristin.ispublished | true | |
cristin.fulltext | original | |