Ecole Polytechnique de Montr�al, Canada
November 23, 2007, 14:00, Room GC B3 424 (click here for the map)
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. (joint work with M. Gamache and J. Ouellet)
Alain Hertz est professeur au D�partement de Math�matiques et de G�nie Industriel de l'�cole Polytechnique de Montr�al. Ses activit�s de recherche sont centr�es principalement sur l'optimisation combinatoire et la th�orie des graphes appliqu�es � la r�solution de probl�me d'horaires et de transport.