Yassine Yaakoubi
RetourPublications
Cahiers du GERAD
Crew pairing problems (CPP) are regularly solved by airlines to produce crew schedules. The goal of CPPs is to find a set of pairings (sequence of flights a...
référence BibTeXLearning to schedule heuristics for the simultaneous stochastic optimization of mining complexes
The simultaneous stochastic optimization of mining complexes (SSOMC) is a large-scale stochastic combinatorial optimization problem that simultaneously manag...
référence BibTeXAn improved integral column generation algorithm using machine learning for aircrew pairing
The crew pairing problem (CPP) is solved in the first step of the crew scheduling process. It consists of creating a set of pairings (sequence of flights, co...
référence BibTeX
The crew pairing problem is generally modelled as a set partitioning problem where the flights have to be partitioned in pairings. A pairing is a sequence of...
référence BibTeX
We present a case study of using machine learning classification algorithms to initialize a large scale commercial operations research solver (GENCOL) in the...
référence BibTeX