7 citations · 13 across the 6 of their papers we have counts for
4 papers · 1 filter
Learning to repeatedly solve routing problems
Mouad Morabit, Guy Desaulniers, Andrea Lodi
In the last years, there has been a great interest in machine-learning-based heuristics for solving NP-hard combinatorial optimization problems. The developed methods have shown po…
A stochastic integer programming approach to reserve staff scheduling with preferences
Carl Perreault-Lafleur, Margarida Carvalho, Guy Desaulniers
Nowadays, reaching a high level of employee satisfaction in efficient schedules is an important and difficult task faced by companies. We tackle a new variant of the personnel sche…
Machine-learning-based arc selection for constrained shortest path problems in column generation
Mouad Morabit, Guy Desaulniers, Andrea Lodi
Column generation is an iterative method used to solve a variety of optimization problems. It decomposes the problem into two parts: a master problem, and one or more pricing probl…
The fragility-constrained vehicle routing problem with time windows
Clément Altman, Guy Desaulniers, Fausto Errico
We study a new variant of the well-studied Vehicle Routing Problem with Time Windows (VRPTW), called the fragility-constrained VRPTW, which assumes that 1) the capacity of a vehicl…