High level rule modeling language for airline crew pairing
Mutlu, Erdal and Birbil, Ş. İlker and Bülbül, Kerem and Yenigün, Hüsnü (2011) High level rule modeling language for airline crew pairing. In: International Conference on Numerical Analysis and Applied Mathematics (ICNAAM 2011), Kassandra, Halkidiki, Greece
Official URL: http://dx.doi.org/10.1063/1.3636853
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 also defined by using complicated rules. When an optimization engine generates a sequence of flights from a given flight network, it has to check all these feasibility rules to ensure whether the sequence forms a valid pairing. Likewise, the engine needs to calculate the cost of the pairing by using certain rules. However, the rules used for checking the feasibility and calculating the costs are usually not static. Furthermore, the airline companies carry out what-if-type analyses through testing several alternate scenarios in each planning period. Therefore, embedding the implementation of feasibility checking and cost calculation rules into the source code of the optimization engine is not a practical approach. In this work, a high level language called ARUS is introduced for describing the feasibility and cost calculation rules. A compiler for ARUS is also implemented in this work to generate a dynamic link library to be used by crew pairing optimization engines.
Repository Staff Only: item control page