Airline crew pairing problems involve optimizing an overall evaluation function containing various conflicting objectives and constraints originating from cost and safety considerations. Classical approaches based on set partitioning or set covering methods separate the solution into two phases, pairing generation and pairing optimization, and evaluate the cost by a weighted-sum of objective va...

The tactical planning process of an airline is typically decomposed into several stages among which fleeting, aircraft routing, and crew pairing form the core. In such a decomposed and sequential approach the output of fleeting forms the input to aircraft routing and crew pairing. In turn, the output to aircraft routing is part of the input to crew pairing. Due to the decomposition, the resulti...

-This paper presents a multiobjective genetic algorithm (MOGA)to solve the train crew pairing problem in railway companies. The proposed MOGA has several features, such as 1) A permutation-based model is proposed rather than the 0-1 set partition model. 2) Instead of pre-assigning a fixed group number of crewmembers, the proposed method can determine it by performing the evolutionary process. 3...

The airline crew scheduling problem is a combinatorial optimization problem and belongs to the class of NPhard problems. An effective method for solving the airline crew scheduling problem can reduce the crew costs and improve crew satisfaction. Because of its complexity, the problem is divided into two subproblems: the crew pairing problem and the crew rostering problem. In this paper, the cre...

The crew pairing problem is an airline optimization problem where a set of least costly pairings (consecutive flights to be flown by a single crew) that covers every flight in a given flight network is sought. A pairing is defined by using a very complex set of feasibility rules imposed by international and national regulatory agencies, and also by the airline itself. The cost of a pairing is a...

The airline crew scheduling problem deals with the construction of crew rotations in order to cover the flights of a given schedule at minimum cost. The problem involves complex rules for the legality and costs of individual pairings and base constraints for the availability of crews at home bases. A typical instance considers a planning horizon of one month and several thousand flights. We pro...

In large airlines, the planning and scheduling of aircrafts and crews is a very important operation. It starts from the analysis of the customers’ demands, passes the stages including timetable construction, fleet planning, and crew pairing, finally ends up with crew rostering. During the past decades, researches had been focused on two complex problems: crew pairing problem and crew rostering ...

The cost of ight crews is the second largest operating cost of an airline. Minimizing it is a fundamental problem in airline planning and operations, and one which has leant itself to mathematical optimization. We discuss several recent advances in the methods used to solve these problems. After describing the general approach taken, we discuss a new method which can be used to obtain approxima...

A: This paper discusses a modeling approach to robust crew pairing when a set of extra flights is likely to be added to the regular flight schedule. The set of these possible extra flights is known at the planning stage. We demonstrate that these extra flights may be incorporated into the schedule if necessary by modifying the planned crew pairings appropriately and without delaying or c...

The airline crew pairing problem (CPP) is one of the classical problems in airline operations research due to its crucial impact on the cost structure of an airline. Moreover, the complex crew regulations and the large scale of the resulting mathematical programming models have rendered it an academically interesting problem over decades. The CPP is a tactical problem, typically solved over a m...