Guy Desaulniers
BackCahiers du GERAD
138 results — page 2 of 7
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
Personnel scheduling consists of determining least-cost work schedules to cover the demand of multiple jobs expressed in number of employees per job and peri...
BibTeX referenceVariable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models
Variable fixing by reduced costs is a popular technique for accelerating the solution process of mixed-integer linear programs. For vehicle routing problems ...
BibTeX reference
Significant progress has been made in the field of computer vision, due to the development of supervised machine learning algorithms, which efficiently extra...
BibTeX reference
In large commercial airlines, the monthly schedule (roster) of the crew members is usually determined by solving two problems sequentially, namely, the crew ...
BibTeX reference
In the Inventory Routing Problem customer demand is satisfied from inventory which is replenished with capacitated vehicles. The objective is to minimize tot...
BibTeX reference
Given a set of duties to be operated over a cyclic one-week horizon and groups of drivers with similar characteristics, the cyclic bus driver rostering probl...
BibTeX reference
We consider a personalized employee scheduling problem with characteristics present in retail stores consisting of multiple departments. In the setting under...
BibTeX referenceA PCA-based approximation scheme for combinatorial optimization with uncertain and correlated data
This paper addresses combinatorial optimization problems under uncertain and correlated data where the mean-covariance information of the random data is assu...
BibTeX reference
The Time Window Assignment Vehicle Routing Problem (TWAVRP) is the problem of assigning time windows for delivery before demand volume becomes known. This i...
BibTeX reference
Personnel scheduling aims at determining the cheapest work schedules to cover the demand for one or more tasks at each period of a given horizon. During the ...
BibTeX referenceA two-stage solution approach for personalized multi-department multi-day shift scheduling
In this paper, we address a personalized multi-department multi-day shift scheduling problem with a multi-skill heterogeneous workforce where employees can b...
BibTeX reference
Vehicle routing problems (VRPs) are among the most studied problems in operations research. Nowadays, the leading exact algorithms for solving many classes o...
BibTeX reference
Maintenance of power generators is essential for reliable and efficient electricity production. Because generators under maintenance are typically inactive, ...
BibTeX reference
This paper focuses on the traveling salesman problem with time windows (TSPTW) that arises in postal services and parcel deliveries and has features differin...
BibTeX reference
Employee scheduling is an important activity in the service industry as it has a significant impact on costs, sales, and profitability. While a large amount ...
BibTeX reference
In this paper we consider a version of the capacitated vehicle routing problem (CVRP) where travel times are assumed to be uncertain and statistically corre...
BibTeX reference
The multiple depot vehicle scheduling problem (MDVSP) has been widely studied in the context of public transit systems. It consists of building vehicle sched...
BibTeX reference