Guy Desaulniers
RetourCahiers du GERAD
135 résultats — page 2 de 7
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...
référence BibTeXVariable 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 ...
référence BibTeX
Significant progress has been made in the field of computer vision, due to the development of supervised machine learning algorithms, which efficiently extra...
référence BibTeX
In large commercial airlines, the monthly schedule (roster) of the crew members is usually determined by solving two problems sequentially, namely, the crew ...
référence BibTeX
In the Inventory Routing Problem customer demand is satisfied from inventory which is replenished with capacitated vehicles. The objective is to minimize tot...
référence BibTeX
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...
référence BibTeX
We consider a personalized employee scheduling problem with characteristics present in retail stores consisting of multiple departments. In the setting under...
référence BibTeXA 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...
référence BibTeX
The Time Window Assignment Vehicle Routing Problem (TWAVRP) is the problem of assigning time windows for delivery before demand volume becomes known. This i...
référence BibTeX
Les problèmes de gestion de personnel visent à déterminer les horaires de travail les moins coûteux pour couvrir la demande d'une ou plusieurs tâches à chaqu...
référence BibTeXA 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...
référence BibTeX
Vehicle routing problems (VRPs) are among the most studied problems in operations research. Nowadays, the leading exact algorithms for solving many classes o...
référence BibTeX
Maintenance of power generators is essential for reliable and efficient electricity production. Because generators under maintenance are typically inactive, ...
référence BibTeX
This paper focuses on the traveling salesman problem with time windows (TSPTW) that arises in postal services and parcel deliveries and has features differin...
référence BibTeX
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 ...
référence BibTeX
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...
référence BibTeX
The multiple depot vehicle scheduling problem (MDVSP) has been widely studied in the context of public transit systems. It consists of building vehicle sched...
référence BibTeX
In global liner shipping networks a large share of transported cargo is transshipped at least once between container vessels, and the total transportation ti...
référence BibTeX
Maintenance activities help prevent costly generator breakdowns but because generators under maintenance are typically unavailable, the impact of maintenance...
référence BibTeXIntegral column generation
The integral simplex using decomposition (ISUD) algorithm was recently developed to solve efficiently set partitioning problems containing a number of variab...
référence BibTeX