1,218 research outputs found
The Integrated Aircraft Routing and Crew Pairing Problem: ILP Based Formulations
Minimization of cost is very important in airline as great profit is an important objective for
any airline system. One way to minimize the costs in airline is by developing an integrated
planning process. Airline planning consists of many difficult operational decision problems
including aircraft routing and crew pairing problems. These two sub-problems, though
interrelated in practice, are usually solved sequentially leading to suboptimal solutions. We
propose an integrated aircraft routing and crew pairing problem model, one approach to
generate the feasible aircraft routes and crew pairs, followed by three approaches to
solve the integrated model. The integrated aircraft routing and crew scheduling problem
is to determine a minimum cost aircraft routes and crew schedules while each flight leg is
covered by one aircraft and one crew. The first approach is an integer programming
solution method, the second formulation is developed in a way to lend itself to be used
efficiently by Dantzig Wolfe decomposition whereas the third one is formulated as a
Benders decomposition method. Encouraging results are obtained when tested on four
types of aircraft based on local flights in Malaysia for one week flight cycle
OPTIMIZATION APPROACHES TO AIRLINE INDUSTRY CHALLENGES: Airline Schedule Planning and Recovery
The airline industry has a long history of developing and applying optimization approaches to their myriad of scheduling problems, including designing flight schedules that maximize profitability while satisfying rules related to aircraft maintenance; generating cost-minimizing, feasible work schedules for pilots and flight attendants; and identifying implementable, low-cost changes to aircraft and crew schedules as disruptions render the planned schedule inoperable. The complexities associated with these problems are immense, including long-and short-term planning horizons; and multiple resources including aircraft, crews, and passengers, all operating over shared airspace and airport capacity. Optimization approaches have played an important role in overcoming this complexity and providing effective aircraft and crew schedules. Historical optimization-based approaches, however, often involve a sequential process, first generating aircraft schedules and then generating crew schedules. Decisions taken in the first steps of the process limit those that are possible in subsequent steps, resulting in overall plans that, while feasible, are typically sub-optimal. To mitigate the myopic effects of sequential solutions, researchers have developed extended models that begin to integrate som
Recommended from our members
Integrating the fleet assignment model with uncertain demand
This thesis was submitted for the degree of Master of Philosophy and awarded by Brunel University.One of the main challenges facing the airline industry is planning under uncertainty, especially in the context of schedule disruptions. The robust models and solution algorithms that have been proposed and developed to handle the uncertain parameters will be discussed. Fleet assignment models (FAM) are used by many airlines to assign aircraft to fights in a schedule to maximize profit. In the context of FAM, the goal of robustness is to produce solutions that perform well relative to uncertainties in demand and operation. In this thesis, we introduce new FAMs (i.e. DFAM1 and DFAM2) that tackles the common problem associated with aircraft utilization. Subsequently, stochastic programming (SP) is presented as a method of choice for the research. Through the use of a two-stage SP with recourse technique, the DFAMs are extended to SP-FAMs (SP-FAM1 and SP-FAM2). The main distinction of the SP-FAM compared with other FAMs is that, given a stochastic passenger demand, it gives a strategic fleet assignment solution that hedges against all possible tactical solutions. In addition, we have a tactical solution for every scenario. In generating the demand scenarios, we use a network-simulation model embedded with a time-series engine that gives a snapshot of one week that is representative of any other week of the scheduling season. We later outline the approach of solving the SP-FAMs where the schedule is compacted through several preprocessing steps before inputting it into SAS-AMPL converter. The SAS-AMPL converter prepares all the data into readable AMPL format. Finally, we execute the optimizer using a FortMP solver (integrated in AMPL) that invokes branch-and-bound algorithm. We give a proof of concept using real data from a Middle East airline. Our investigations establish clear benefits of the recourse FAM compared to alternative models. Finally, we propose areas of future research to improve SP-FAM robustness through solution algorithms, revenue management (RM) effects, calibration of network-simulation models and system integration
Railway Crew Rescheduling with Retiming
Railway operations are disrupted frequently, e.g. the Dutch railway network experiences about three large disruptions per day on average. In such a disrupted situation railway operators need to quickly adjust their resource schedules. Nowadays, the timetable, the rolling stock and the crew schedule are recovered in a sequential way. In this paper, we model and solve the crew rescheduling problem with retiming. This problem extends the crew rescheduling problem by the possibility to delay the departure of some trains. In this way we partly integrate timetable adjustment and crew rescheduling. The algorithm is based on column generation techniques combined with Lagrangian heuristics. In order to prevent a large increase in computational time, retiming is allowed only for a limited number of trains where it seems very promising. Computational experiments with real-life disruption data show that, compared to the classical approach, it is possible to find better solutions by using crew rescheduling with retiming.
Robust airline schedule planning : review and development of optimization approaches
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering; and, (S.M.)--Massachusetts Institute of Technology, Operations Research Center, 2004.Includes bibliographical references (p. 87-89).Major airlines aim to generate schedules that maximize profit potential and satisfy constraints involving flight schedule design, fleet assignment, aircraft maintenance routing and crew scheduling. Almost all aircraft and crew schedule optimization models assume that flights, aircraft, crews, and passengers operate as planned. Thus, airlines typically construct plans that maximize revenue or minimize cost based on the assumption that every flight departs and arrives as planned. Because flight delays and cancellations result from numerous causes, including severe weather conditions, unexpected aircraft and crew failures, and congestion at the airport and in the airspace, this deterministic, optimistic scenario rarely, if ever, occurs. In fact, schedule plans are frequently disrupted and airlines often incur significant costs in addition to those originally planned. To address this issue, an approach is to design schedules that are robust to schedule disruptions and attempt to minimize realized, and not planned, costs. In this research, we review recovery approaches and robustness criteria in the context of airline schedule planning. We suggest new approaches for designing fleet assignments that facilitate recovery operations, and we present models to generate plans that allow for more robust crew operations, based on the idea of critical crew connections. We also examine the impact on robustness of new scheduling practices to debank hub airports.by Claudine Biova Agbokou.S.M
Methods for Improving Robustness and Recovery in Aviation Planning.
In this dissertation, we develop new methods for improving robustness and recovery in aviation planning. In addition to these methods, the contributions of this dissertation include an in-depth analysis of several mathematical modeling approaches and proof of their structural equivalence. Furthermore, we analyze several decomposition approaches, the difference in their complexity and the required computation time to provide insight into selecting the most appropriate formulation for a particular problem structure. To begin, we provide an overview of the airline planning process, including the major components such as schedule planning, fleet assignment and crew planning approaches. Then, in the first part of our research, we use a recursive simulation-based approach to evaluate a flight schedule's overall robustness, i.e. its ability to withstand propagation delays. We then use this analysis as the groundwork for a new approach to improve the robustness of an airline's maintenance plan. Specifically, we improve robustness by allocating maintenance rotations to those aircraft that will most likely benefit from the assignment. To assess the effectiveness of our approach, we introduce a new metric, maintenance reachability, which measures the robustness of the rotations assigned to aircraft. Subsequently, we develop a mathematical programming approach to improve the maintenance reachability of this assignment. In the latter part of this dissertation, we transition from the planning to the recovery phase. On the day-of-operations, disruptions often take place and change aircraft rotations and their respective maintenance assignments. In recovery, we focus on creating feasible plans after such disruptions have occurred. We divide our recovery approach into two phases. In the first phase, we solve the Maintenance Recovery Problem (MRP), a computationally complex, short-term, non-recurrent recovery problem. This research lays the foundation for the second phase, in which we incorporate recurrence, i.e. the property that scheduling one maintenance event has a direct implication on the deadlines for subsequent maintenance events, into the recovery process. We recognize that scheduling the next maintenance event provides implications for all subsequent events, which further increases the problem complexity. We illustrate the effectiveness of our methods under various objective functions and mathematical programming approaches.Ph.D.Industrial & Operations EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/91539/1/mlapp_1.pd
Determining Pilot Manning for Bomber Longevity
In support of US Air Force efforts to conserve resources without sacrificing capability, this research examines the question of whether the 509th Bomb Wing could continue to provide maximum combat capability with fewer assigned pilots. During peacetime, pilot proficiency training comprises the majority of annual flying hours for the small B-2 bomber fleet. Optimal pilot manning will decrease the accumulation of excess wear on the airframes; helping to extend the viable life of the B-2 fleet and preserve the deterrent and combat capabilities that it provides to the United States. The operations and maintenance activity flows for B-2 aircraft and pilots in a notional sustained combat scenario are constructed in an Arena discrete-event simulation model. The model provides the capability to determine optimum manning levels for combat-qualified B-2 pilots across a range of fleet mission capable rates. Determination of actual optimum manning levels is sensitive to duration and probability parameters which are unavailable for use in this work. Notional parameter estimates are used to assess combat mission capability and pilot manning
Recommended from our members
Models and methods for operational planning in freight railroads
textRailroads are facing increasing demand for freight transportation. Effective planning and scheduling are crucial to improve the utilization of expensive resources (such as crew and track), reduce operational costs, and provide on-time service. This dissertation focuses on problem modeling and solution method development for real planning problems faced by railroads. It consists of three chapters that study two important planning problems in the daily operations of U.S. freight railroads: crew assignment and train movement planning. Chapter 2 proposes an optimization model to decide crew-to-train assignments and deadheads for double-ended crew districts. We develop an effective solution approach, combining optimization and a standalone heuristic, that generates optimal solutions in minutes. The excellent performance of this solution approach makes it well-suited for implementation within a real-time decision support tool for crew dispatchers. Chapter 3 discusses crew repositioning given the uncertainty in trains’ arrival and departure times. We propose models that minimize the expected crew holding, train delay, and deadheading cost, and develop both exact and heuristic solution methods to provide insights for crew planning under train schedule uncertainty. The last chapter studies the movement planning problem for trains traveling in a territory with multiple through tracks (mainlines) and various junctions. We explore a number of heuristic algorithms to obtain good solutions within a reasonable amount of time. The contributions of this dissertation include modeling enhancements, algorithmic development, implementation and computational testing, and validation using real data.Operations Research and Industrial Engineerin
- …