Airline Planning under Uncertainty.
dc.contributor.author | Ahmad Beygi, Shervin | en_US |
dc.date.accessioned | 2008-08-25T20:57:30Z | |
dc.date.available | NO_RESTRICTION | en_US |
dc.date.available | 2008-08-25T20:57:30Z | |
dc.date.issued | 2008 | en_US |
dc.date.submitted | 2008 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/60861 | |
dc.description.abstract | In this dissertation, we study the impact of uncertainty associated with potential delays on the operational performance of the airline plans, considering different stages of the airline planning process. In the first part of this dissertation, we investigate the potential for flight delays to propagate throughout a passenger airline network. We also define metrics to quantify delay propagation by analyzing the connections in a flight network. As the computational results demonstrate, delays can sometimes propagate substantially and have a major impact on network efficiency. Therefore, in the second part, we develop a linear programming approach to strategically use slack in the network in order to mitigate the impact of disruption without increasing cost. In these models we allow flight departure times to change within a given time window while keeping the original connections feasible but re-allocating slack where it can best be utilized. The motivation for the third part of this dissertation stems from the fact that re-timing the schedule per se cannot fully capture all the opportunities for improved robustness. Instead, it may also be necessary to change the fleet assignment and crew schedule. Thus, in a robust planning tool, it is necessary to schedule flights across all fleet-types simultaneously. This, in turn, increases the number of flights to be considered which dramatically impacts tractability. Therefore, it is essential to generate crew pairings (sequences of flights that can be covered by a single crew) on larger flight networks. In the third part, we present a new, integer programmingbased approach to supplement the existing techniques for generating crew pairings. To demonstrate the performance of this approach, computational experiments based on data from a major U.S. carrier are presented. | en_US |
dc.format.extent | 906773 bytes | |
dc.format.extent | 1373 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | en_US |
dc.subject | Airline Robust Planning | en_US |
dc.subject | Airline Planning Under Uncertainty | en_US |
dc.subject | Operations Research | en_US |
dc.subject | Transportation and Logistics | en_US |
dc.subject | Delay Propagation | en_US |
dc.subject | Crew Pairing | en_US |
dc.title | Airline Planning under Uncertainty. | en_US |
dc.type | Thesis | en_US |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Industrial & Operations Engineering | en_US |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | en_US |
dc.contributor.committeemember | Cohn, Amy M. | en_US |
dc.contributor.committeemember | Beil, Damian R. | en_US |
dc.contributor.committeemember | Epelman, Marina A. | en_US |
dc.contributor.committeemember | Sinha, Amitabh | en_US |
dc.subject.hlbsecondlevel | Industrial and Operations Engineering | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/60861/1/shervin_1.pdf | |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.