Guy Desaulniers
RetourCahiers du GERAD
135 résultats — page 5 de 7
La plupart des compagnies distribuant de l’huile de chauffage résolvent des problèmes de tournées de véhicules presque quotidiennement. Ces problèmes peuven...
référence BibTeXIntegrated Airline Crew Scheduling: A Bi-Dynamic Constraint Aggregation Method using Neighborhoods
The integrated crew scheduling (ICS) problem consists of determining, for a set of available crew members, least-cost schedules that cover all flights and re...
référence BibTeX
The multi-activity assignment problem consists of assigning interruptible activities to given work shifts so as to match as much as possible for each activit...
référence BibTeX
The vehicle routing problem with time windows VRPTW consists of finding least-cost vehicle routes to service given customers exactly once each while satisfyi...
référence BibTeX
Traditionally, the airline crew scheduling problem has been decomposed into a crew pairing and a crew assignment problem that are solved sequentially. The f...
référence BibTeX
In several companies such as large retail stores, the employees perform different activities (e.g., cashier or clerk in a specific department) to respond to ...
référence BibTeX
In this paper, we propose a generic model based on linear programming that allows building an optimal production plan for a work shift in an open-pit mine. T...
référence BibTeXEnhanced Branch-and-Price-and-Cut for Vehicle Routing with Split Deliveries and Time Windows
In this paper, we study the split delivery vehicle routing problem with time windows SDVRPTW that is a variant of the well-known vehicle routing problem with...
référence BibTeX
A crew pairing is a sequence of flights, connections and rests that start and end at a crew base and is assigned to a single crew. The crew pairing problem c...
référence BibTeX
As of April 2007, the European Union has new regulations concerning driver working hours. These rules force the placement of breaks and rests into the vehicl...
référence BibTeX
This paper presents a general framework for formulating cutting planes in the context of column generation for integer programs. Valid inequalities can be de...
référence BibTeX
Given a set of scheduled flights that must be operated by the same aircraft type, the aircraft routing problem (ARP) consists of building anonymous aircraft ...
référence BibTeX
In the <i>Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows</i>, the set of customers is the union of <i>delivery customers</i> and...
référence BibTeX
The Dutch railway network experiences about three large disruptions per day on average. In this paper, we present an algorithm to reschedule the crews when s...
référence BibTeX
This work presents an exact branch-cut-and-price algorithm for the vehicle routing problem with time windows (VRPTW) where the well-known clique inequalities...
référence BibTeX
We consider a maritime inventory routing problem in the liquefied natural gas (LNG) business. Here, an actor is responsible for the routing of the fleet of s...
référence BibTeX
This paper addresses the split delivery vehicle routing problem with time windows (SDVRPTW) that consists of determining least-cost vehicle routes to service...
référence BibTeX
The bidline scheduling problem with equity arises in several North American airlines. It consists of determining anonymous monthly schedules, called bidlines...
référence BibTeXPath Reduced Costs for Eliminating Arcs
In many branch-and-price algorithms, the column generation pricing problem consists of computing feasible paths in a network. In this paper, we show how, in...
référence BibTeX
Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (VRPTW) consists of determining a set of feasible v...
référence BibTeX