Title:
Large-scale mixed integer optimization approaches for scheduling airline operations under irregularity
Large-scale mixed integer optimization approaches for scheduling airline operations under irregularity
| dc.contributor.advisor | Clarke, John-Paul B. | |
| dc.contributor.advisor | Johnson, Ellis L. | |
| dc.contributor.author | Petersen, Jon D. | en_US |
| dc.contributor.committeeMember | Ahmed, Shabbir | |
| dc.contributor.committeeMember | Clarke, Michael | |
| dc.contributor.committeeMember | Nemhauser, George L. | |
| dc.contributor.department | Industrial and Systems Engineering | en_US |
| dc.date.accessioned | 2012-06-06T16:47:16Z | |
| dc.date.available | 2012-06-06T16:47:16Z | |
| dc.date.issued | 2012-03-30 | en_US |
| dc.description.abstract | Perhaps no single industry has benefited more from advancements in computation, analytics, and optimization than the airline industry. Operations Research (OR) is now ubiquitous in the way airlines develop their schedules, price their itineraries, manage their fleet, route their aircraft, and schedule their crew. These problems, among others, are well-known to industry practitioners and academics alike and arise within the context of the planning environment which takes place well in advance of the date of departure. One salient feature of the planning environment is that decisions are made in a frictionless environment that do not consider perturbations to an existing schedule. Airline operations are rife with disruptions caused by factors such as convective weather, aircraft failure, air traffic control restrictions, network effects, among other irregularities. Substantially less work in the OR community has been examined within the context of the real-time operational environment. While problems in the planning and operational environments are similar from a mathematical perspective, the complexity of the operational environment is exacerbated by two factors. First, decisions need to be made in as close to real-time as possible. Unlike the planning phase, decision-makers do not have hours of time to return a decision. Secondly, there are a host of operational considerations in which complex rules mandated by regulatory agencies like the Federal Administration Association (FAA), airline requirements, or union rules. Such restrictions often make finding even a feasible set of re-scheduling decisions an arduous task, let alone the global optimum. The goals and objectives of this thesis are found in Chapter 1. Chapter 2 provides an overview airline operations and the current practices of disruption management employed at most airlines. Both the causes and the costs associated with irregular operations are surveyed. The role of airline Operations Control Center (OCC) is discussed in which serves as the real-time decision making environment that is important to understand for the body of this work. Chapter 3 introduces an optimization-based approach to solve the Airline Integrated Recovery (AIR) problem that simultaneously solves re-scheduling decisions for the operating schedule, aircraft routings, crew assignments, and passenger itineraries. The methodology is validated by using real-world industrial data from a U.S. hub-and-spoke regional carrier and we show how the incumbent approach can dominate the incumbent sequential approach in way that is amenable to the operational constraints imposed by a decision-making environment. Computational effort is central to the efficacy of any algorithm present in a real-time decision making environment such as an OCC. The latter two chapters illustrate various methods that are shown to expedite more traditional large-scale optimization methods that are applicable a wide family of optimization problems, including the AIR problem. Chapter 4 shows how delayed constraint generation and column generation may be used simultaneously through use of alternate polyhedra that verify whether or not a given cut that has been generated from a subset of variables remains globally valid. While Benders' decomposition is a well-known algorithm to solve problems exhibiting a block structure, one possible drawback is slow convergence. Expediting Benders' decomposition has been explored in the literature through model reformulation, improving bounds, and cut selection strategies, but little has been studied how to strengthen a standard cut. Chapter 5 examines four methods for the convergence may be accelerated through an affine transformation into the interior of the feasible set, generating a split cut induced by a standard Benders' inequality, sequential lifting, and superadditive lifting over a relaxation of a multi-row system. It is shown that the first two methods yield the most promising results within the context of an AIR model. | en_US |
| dc.description.degree | PhD | en_US |
| dc.identifier.uri | http://hdl.handle.net/1853/43662 | |
| dc.publisher | Georgia Institute of Technology | en_US |
| dc.subject | Airline recovery | en_US |
| dc.subject | Operations research | en_US |
| dc.subject | Large-scale optimization | en_US |
| dc.subject.lcsh | Mathematical optimization | |
| dc.subject.lcsh | Integer programming | |
| dc.subject.lcsh | Air traffic capacity | |
| dc.subject.lcsh | Scheduling | |
| dc.title | Large-scale mixed integer optimization approaches for scheduling airline operations under irregularity | en_US |
| dc.type | Text | |
| dc.type.genre | Dissertation | |
| dspace.entity.type | Publication | |
| local.contributor.advisor | Johnson, Ellis L. | |
| local.contributor.corporatename | H. Milton Stewart School of Industrial and Systems Engineering | |
| local.contributor.corporatename | College of Engineering | |
| relation.isAdvisorOfPublication | 889e3658-7945-43ec-8c94-a0b8989407b1 | |
| relation.isOrgUnitOfPublication | 29ad75f0-242d-49a7-9b3d-0ac88893323c | |
| relation.isOrgUnitOfPublication | 7c022d60-21d5-497c-b552-95e489a06569 |
Files
Original bundle
1 - 1 of 1
- Name:
- petersen_jon_d_201205_phd.pdf
- Size:
- 2.62 MB
- Format:
- Adobe Portable Document Format
- Description: