A new heuristic branching scheme for the crew pairing problem with base constraints.
Frédéric QuesnelGuy DesaulniersFrançois SoumisPublished in: Comput. Oper. Res. (2017)
Keyphrases
- crew pairing
- set covering
- aircraft routing
- crew scheduling
- constraint satisfaction
- optimal solution
- search algorithm
- search tree
- branch and bound
- constraint violations
- simulated annealing
- solution quality
- feasible solution
- constrained optimization
- global constraints
- mixed integer program
- constraint satisfaction problems
- dynamic programming
- variable ordering heuristics