A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding

Authors:
Michel Gamache;Alain Hertz;Jérôme Olivier Ouellet
Affiliations:
Département des génies civil, géologique et des mines, ícole Polytechnique, Montréal, Que., Canada;Département de mathématiques et de génie industriel, ícole Polytechnique, Montréal, Que., Canada;Département de mathématiques et de génie industriel, ícole Polytechnique, Montréal, Que., Canada
Venue:
Computers and Operations Research
Year:
2007

Citing 6
Cited 7

Using tabu search techniques for graph coloring

Computing
Precoloring extension. I: Interval graphs

Discrete Mathematics - Special volume (part 1) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs”
A tabu search heuristic for the vehicle routing problem

Management Science
Tabu Search

Tabu Search
The Preferential Bidding System at Air Canada

Transportation Science
A Column Generation Approach for Large-Scale Aircrew Rostering Problems

Operations Research

A search space "cartography" for guiding graph coloring heuristics

Computers and Operations Research
Ant colony optimization-based algorithm for airline crew scheduling problem

Expert Systems with Applications: An International Journal
Coloring large graphs based on independent set extraction

Computers and Operations Research
A new DSATUR-based algorithm for exact vertex coloring

Computers and Operations Research
Intensification/Diversification-Driven ILS for a graph coloring problem

EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Selective graph coloring in some special classes of graphs

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm

Computational Optimization and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider a monthly crew scheduling problem with preferential bidding in the airline industry. We propose a new methodology based on a graph coloring model and a tabu search algorithm for determining if the problem contains at least one feasible solution. We then show how to combine the proposed approach with a heuristic sequential scheduling method that uses column generation and branch-and-bound techniques.