Show simple item record

dc.contributor.authorGupta, Shubham
dc.contributor.authorBertsimas, Dimitris J
dc.date.accessioned2014-06-04T15:01:00Z
dc.date.available2014-06-04T15:01:00Z
dc.date.issued2011-10
dc.date.submitted2011-05
dc.identifier.isbn978-1-61839-446-0
dc.identifier.isbn1618394460
dc.identifier.urihttp://hdl.handle.net/1721.1/87621
dc.description.abstractIn this paper, we study the first application of robust and adaptive optimization in the Air Traffic Flow Management (ATFM) problem. The existing models for network-wide ATFM assume deterministic capacity estimates across airports and sectors without taking into account the uncertainty in capacities induced by weather. We introduce a weather-front based approach to model the uncertainty inherent in airspace capacity estimates resulting from the impact of a small number of weather fronts moving across the National Airspace (NAS). The key advantage of our uncertainty set construction is the low-dimensionality (uncertainty in only two parameters govern the overall uncertainty set for each airspace element). We formulate the consequent ATFM problem under capacity uncertainty within the robust and adaptive optimization framework and propose tractable solution methodologies. Our theoretical contributions are as follows: i) we propose a polyhedral description of the convex hull of the discrete uncertainty set; ii) we prove the equivalence of the robust problem to a modified instance of the deterministic problem; and iii) we solve optimally the LP relaxation of the adaptive problem using piece-wise affine policies where the number of pieces in an optimal policy are governed by the number of extreme points in the uncertainty set. A particularly attractive feature is that for most practically encountered instances, an affine policy suffices to solve the adaptive problem optimally. Finally, we report empirical results from the proposed models on real world flight schedules augmented with simulated weather fronts that illuminate the merits of our proposal. The key insights from our computational results are: i) the robust problem inherits all the attractive properties of the deterministic problem (e.g., superior integrality properties and fast computational times); and ii) the price of robustness and adaptability is typically small.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (NSF Grant EFRI-0735905)en_US
dc.language.isoen_US
dc.publisherAGIFORS - International Federation of Operational Research Societiesen_US
dc.relation.isversionofhttp://toc.proceedings.com/13874webtoc.pdfen_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceOther repositoryen_US
dc.titleMultistage Air Traffic Flow Management under Capacity Uncertainty: A Robust and Adaptive Optimization Approachen_US
dc.typeArticleen_US
dc.identifier.citationGupta, Shubham and Dimitris Bertsimas. "Multistage Air Traffic Flow Management under Capacity Uncertainty: A Robust and Adaptive Optimization Approach." 51st AGIFORS Annual Proceedings: annual symposium and study group meeting, Antalya, Turkey, 10-14 October 2011. p. 692-721.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Operations Research Centeren_US
dc.contributor.departmentSloan School of Managementen_US
dc.contributor.mitauthorBertsimas, Dimitris J.en_US
dc.contributor.mitauthorGupta, Shubhamen_US
dc.relation.journalProceedings of the 51st AGIFORS Annual Symposium and Study Group Meetingen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsGupta, Shubham; Bertsimas, Dimitris J.en_US
dc.identifier.orcidhttps://orcid.org/0000-0002-1985-1003
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record