Disruption management is one of the most important scheduling problems in the airline industry because of the elevated costs associated, however this is relatively new research area comparing for example with fleet and tail assignment. The major goal to solve this kind of problem is to achieve a feasible solution for the airline company minimizing the several costs involved and within time cons...

We describe the design of an optimizer for 0-1 integer programming aimed at solving large problems. The algorithm is based on very simple operations giving it a low complexity, and we show that for large set covering problems it can produce very good solutions compared to other methods. This is the only optimizer in the Carmen system for airline crew scheduling, used by several major European a...

The set covering problem (SCP) is one of representative combinatorial optimization problems, which has many practical applications. The continuous development of mathematical programming has derived a number of impressive heuristic algorithms as well as exact branch-and-bound algorithms, which can solve huge SCP instances of bus, railway and airline crew scheduling problems. We survey heuristic...

A subgradient method for solving large linear programs is implemented and analyzed in a column generation framework. A performance comparison of the implementation is made versus the commercial linear programming solver XPress. Computational results from tests using data from airline crew scheduling, in particular crew rostering, show that the method performs very well in a column generation sc...

We propose an interactive Goal Programming (GP) for operational recovery problems that are present in diverse areas of application. After defining the problem we discuss its relevance to scenarios taken from airline scheduling, supply chain management and call centers operations. We then construct the GP procedure for operational recovery decision making and illustrate the mechanics of the prop...

This paper tackles a generalization of the weight constrained shortest path problem in a directed network (WCSPP) in which replenishment arcs, that reset the accumulated weight along the path to zero, appear in the network. Such situations arise, for example, in airline crew pairing applications, where the weight represents duty hours, and replenishment arcs represent crew overnight rests, and ...

The ability to generate crew pairings quickly is essential to solving the airline crew scheduling problem. Although techniques for doing so are well-established, they are also highly customized and require significant implementation efforts. This greatly impedes researchers studying important problems such as robust planning, integrated planning, and automated recovery, all of which also requir...

This study developed a decision support system (DSS) to schedule EGYPTAIR airline decisions regarding purchasing, leasing, or disposing of aircraft over period of time based on passenger demand forecasting and all costs associated with operating fleet of aircraft, the study implemented on three routes on EGYPTAIR airlines. Refer ences Hsu, C. -I. , Li, H. -C. , Liu, S. -M. , Chao, C. -C. ,2011....

Trip generation is the most time-consuming phase of the crew scheduling process. A large number of trips must be constructed while satisfying a complex set of regulations. In this paper, we present an efficient trip generation method that utilizes effectively a legality checking system in order to reduce the corresponding search space. Special pruning rules are defined using a high-level rule l...

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...