1,648 research outputs found
Real-World Airline Crew Pairing Optimization: Customized Genetic Algorithm versus Column Generation Method
Airline crew cost is the second-largest operating cost component and its
marginal improvement may translate to millions of dollars annually. Further,
it's highly constrained-combinatorial nature brings-in high impact research and
commercial value. The airline crew pairing optimization problem (CPOP) is aimed
at generating a set of crew pairings, covering all flights from its timetable,
with minimum cost, while satisfying multiple legality constraints laid by
federations, etc. Depending upon CPOP's scale, several Genetic Algorithm and
Column Generation based approaches have been proposed in the literature.
However, these approaches have been validated either on small-scale flight
datasets (a handful of pairings) or for smaller airlines (operating-in
low-demand regions) such as Turkish Airlines, etc. Their search-efficiency gets
impaired drastically when scaled to the networks of bigger airlines. The
contributions of this paper relate to the proposition of a customized genetic
algorithm, with improved initialization and genetic operators, developed by
exploiting the domain-knowledge; and its comparison with a column generation
based large-scale optimizer (developed by authors). To demonstrate the utility
of the above-cited contributions, a real-world test-case (839 flights),
provided by GE Aviation, is used which has been extracted from the networks of
larger airlines (operating up to 33000 monthly flights in the US).Comment: 7 pages, 3 figure
The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints
This is the author accepted manuscript. The final version is available from the publisher via the DOI in this recordThe tail assignment problem is a critical part of the airline planning process that assigns specific aircraft to sequences of flights, called lines-of-flight, to satisfy operational constraints. The aim of this paper is to develop an operationally flexible method, based upon the one-day routes business model, to compute tail assignments that satisfy short-range—within the next three days—aircraft maintenance requirements. While maintenance plans commonly span multiple days, the methods used to compute tail assignments for the given plans can be overly complex and provide little recourse in the event of schedule perturbations. The presented approach addresses operational uncertainty by using solutions from the one-day routes aircraft maintenance routing approach as input. The daily tail assignment problem is solved with an objective to satisfy maintenance requirements explicitly for the current day and implicitly for the subsequent two days. A computational study will be performed to assess the performance of exact and heuristic solution algorithms that modify the input lines-of-flight to reduce maintenance misalignments. The daily tail assignment problem and the developed algorithms are demonstrated to compute solutions that effectively satisfy maintenance requirements when evaluated using input data collected from three different airlines
Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
In this paper, we develop a simultaneous column-and-row generation algorithm that could be applied to a general class of large-scale linear programming problems. These problems typically arise in the context of linear programming formulations with exponentially many variables. The defining property for these formulations is a set of linking constraints, which are either too many to be included in the formulation directly, or the full set of linking constraints can only be identified, if all variables are generated explicitly. Due to this dependence between columns and rows, we refer to this class of linear programs as problems with column-dependent-rows. To solve these problems, we need to be able to generate both columns and rows on-the-fly within an efficient solution approach. We emphasize that the generated rows are structural constraints and distinguish our work from the branch-and-cut-and-price framework. We first characterize the underlying assumptions for the proposed column-and-row generation algorithm. These assumptions are general enough and cover all problems with column-dependent-rows studied in the literature up until now to
the best of our knowledge. We then introduce in detail a set of pricing subproblems, which are used within the proposed column-and-row generation algorithm. This is followed by a formal discussion on the optimality of the algorithm. To illustrate the proposed approach, the paper is concluded by applying the proposed framework to the multi-stage cutting stock and the quadratic set covering problems
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
- …