Guy Desaulniers
RetourCahiers du GERAD
135 résultats — page 3 de 7
The bid construction problem (BCP) for combinatorial total truckload transportation service procurement auctions consists of determining one or several bids ...
référence BibTeX
Personnel scheduling consists of determining least-cost employee work schedules to cover the demand of one or several jobs in each period of a time horizon. ...
référence BibTeX
La méthode de branch-cut-and-price est la plus performante pour une grande panoplie de problèmes de tournées de véhicules (PTV). Pour plusieurs d'entre eux...
référence BibTeX
In this paper, we propose an integer programming model for obtaining lower bounds for the curriculum-based course timetabling problem, in which weekly assign...
référence BibTeX
Synchronization of workers and vehicles plays a major role in many industries such as logistics, healthcare or airport ground handling. In this paper, we fo...
référence BibTeX
La création d’horaires de personnel aériens est généralement effectuée en deux étapes : la création de rotations d’équipage, suivie par la création d’horaire...
référence BibTeXA Branch-Price-and-Cut algorithm for a production-routing problem with short-lifespan products
We study a rich production-routing problem with time windows arising at a catering services company. The production part consists of assembling the meals to ...
référence BibTeX
The vehicle routing problem with time windows (VRPTW) consists of finding least-cost vehicle routes to satisfy the demands of customers that can be visited...
référence BibTeX
Inventory routing problems aim at minimizing the cost of the total distance traveled over a time horizon discretized in periods, while guaranteeing that th...
référence BibTeX
This paper introduces the pickup and delivery problem with time windows and handling operations. In this problem, the loading compartment of a vehicle is mod...
référence BibTeX
Given a flight schedule and a set of aircraft of different types, the airline fleet assignment problem (FAP) consists of assigning an aircraft type to each f...
référence BibTeX
The tail assignment problem is a critical part of the airline planning process that assigns specific aircraft to sequences of flights, called lines-of-flight...
référence BibTeX
Cet article traite la prise en compte d'incertitudes lors de la résolution de conflits. Plus particulièrement, nous considérons les incertitudes dues aux err...
référence BibTeX
Nous présentons un modèle déterministe pour le problème de détection et de résolution de conflits entre aéronefs. Les aspects liés à la dynamique des avions,...
référence BibTeX
This paper introduces a new primal algorithm for solving a linear program LP. In this algorithm, a pricing problem, namely a linear fractional program, is ...
référence BibTeX
Dans cet article, nous étudions des stratégies pour résoudre le problème de partitionnement d'ensemble (PPE), en particulier les gains en efficacité qui pe...
référence BibTeX
This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and multiple stacks. Each stack is rear-loade...
référence BibTeX
Effective route planning for battery electric commercial vehicle (ECV) fleets has to take into account their limited autonomy and the possibility of visiting...
référence BibTeX
Including employee preferences in a shift-scheduling scheme raises the question of how to aggregate employee satisfactions in a sensible manner. To do so, we...
référence BibTeX
In this article, we solve the pickup and delivery problem with time windows and last-in-first-out (LIFO) loading. LIFO loading minimizes handling while unloa...
référence BibTeX