An integer programming approach to generating airline crew pairings
Computers and Operations Research
Robust crew pairing for managing extra flights
Computers and Operations Research
Shorter path constraints for the resource constrained shortest path problem
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Aircrew pairings with possible repetitions of the same flight number
Computers and Operations Research
Solving a robust airline crew pairing problem with column generation
Computers and Operations Research
| Hi-index | 0.00 |
Solving LP relaxations of airline crew scheduling models is computationally challenging due to the presence of a large number of variables, complex feasibility rules to generate columns, and nonlinear cost. We perform computational experiments with a nonlinear pricing strategy. We develop a column generation scheme that uses several pruning rules to fathom column enumeration. The pruning rules are categorized into approximate and exact, where the approximate rules might prune columns that would yield an improved objective value. The pruning rules use the fact that columns are paths in a network, and we use shortest path algorithms and their extensions to obtain bounds.