Guy Desaulniers
BackCahiers du GERAD
135 results — page 1 of 7
Bus scheduling in public transit consists in determining a set of bus schedules to cover a set of timetabled trips at minimum cost. This planning process has...
BibTeX reference
This study addresses large-scale personnel scheduling problems in the service industry by combining mathematical programming with data mining techniques to...
BibTeX reference
Decision trees are highly interpretable models for solving classification problems in machine learning (ML). The standard ML algorithms for training decision...
BibTeX reference
The multi-depot scheduling problem (MDVSP) is one of the most studied problem in public transport service planning. It consists of assigning buses to each ti...
BibTeX reference
Personnel scheduling consists in determining employee work schedules (sequences of work shifts and days off) to cover the demands of multiple jobs over a pl...
BibTeX referenceMachine-learning-based arc selection for constrained shortest path problems in column generation
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 on...
BibTeX reference
In this paper, we introduce a new variant of the vehicle routing problem with time windows (VRPTW) that arises in parcel delivery by postal services. In addi...
BibTeX referenceParallel stimulation of disruptions for personnel scheduling in a flexible working environment
Personnel scheduling aims to determine least-cost personnel schedules to meet the demand for employees in each period of a planning horizon. In this article,...
BibTeX referenceDeep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering
The personalized crew rostering problem (CRP) consists of assigning pairings (sequences of flights, deadheads, connections, and rests, forming one or several...
BibTeX referenceAn 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...
BibTeX reference
We consider logistic collaborations where multiple carriers collaborate by consolidating demands, combining delivery routes, and serving new customers. Logis...
BibTeX reference
Given a set of predefined duties and groups of drivers, the duty assignment problem with group-based driver preferences (DAPGDP) aims at building rosters tha...
BibTeX reference
We study a new variant of the well-studied Vehicle Routing Problem with Time Windows (VRPTW), called the fragility-constrained VRPTW, which assumes that ...
BibTeX referenceA branch-price-and-cut algorithm for the two-echelon vehicle routing problem with time windows
In this paper, we propose an exact branch-price-and-cut (BPC) algorithm for the two-echelon vehicle routing problem with time windows. This problem arises i...
BibTeX reference
We study a new variant of the vehicle routing problem, which arises in hospital-wide scheduling of physical therapists. Multiple service locations exist for...
BibTeX reference
Column generation (CG) algorithms are well known to suffer from convergence issues due, mainly, to the degenerate structure of their master problem and the ...
BibTeX reference
Column generation (CG) is widely used for solving large-scale optimization problems. This article presents a new approach based on a machine learning (ML) t...
BibTeX reference
The monthly crew pairing problem (CPP) consists of determining a least-cost set of feasible crew pairings (sequences of flights starting and ending at a crew...
BibTeX reference
Column generation algorithms for solving vehicle routing problems often rely on a relaxed pricing subproblem where routes may be non-elementary and which is ...
BibTeX reference
The integral column generation algorithm (ICG) was recently introduced to solve set partitioning problems involving a very large number of variables. This pr...
BibTeX reference