Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Graduate Theses
  5. Analysis of efficiency and fairness in stochastic ground holding models

Analysis of efficiency and fairness in stochastic ground holding models

Thumbnail Image
Download
Name

962733527-MIT.pdf

Description
Full printable version
Size

6.3 MB

Format

Adobe PDF

Checksum (MD5)

48be40930343186195c8bbd89674e815

Author(s)
Kavassery Gopalakrishnan, Karthik
Advisor(s)
Hamsa Balakrishnan.
Date Issued
2016
Publisher
Massachusetts Institute of Technology
Abstract
Allocating limited resources in a fair and efficient manner is crucial to the functioning of the air transportation system. Limited arrival and departure capacity at airports is one of the major drivers of congestion. The Ground Holding Problem refers to the problem of efficiently allocating landing slots during periods of reduced capacity. In this thesis, we propose a new model of the Ground Holding Problem. This formulation accounts for fairness in slot allocation and operational constraints, while being robust to the duration and severity of the disruption. The performance of this new method is evaluated using operational flight data.
Description
Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2016.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 71-73).
Subjects
Aeronautics and Astronautics.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Persistent DSpace Link
http://hdl.handle.net/1721.1/105617
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.