Guy Desaulniers
BackCahiers du GERAD
135 results — page 4 of 7
We present a matheuristic, an integer programming based heuristic, for the liner shipping network design problem. This problem consists of finding a set of...
BibTeX reference
The inventory-routing problem (IRP) integrates two well-studied problems, namely, inventory management and vehicle routing. Given a set of customers to servi...
BibTeX reference
The <b>VRPTW-ST</b> introduced by Errico et al. (2013) in the form of a chance-constrained model mainly differs from other vehicle routing problems with st...
BibTeX reference
Aircraft maintenance planning is of critical importance to the safe and efficient operations of an airline. It is common to solve the aircraft routing and ma...
BibTeX reference
This paper proposes a state-of-the-art branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (VRPSD). We adapt the model of ...
BibTeX reference
In this paper we present a comparative study of several strategies that can be applied to achieve the so-called elementary lower bound in vehicle routing p...
BibTeX reference
Onshore oil fields may contain hundreds of wells that use sophisticated and complex equipments. These equipments need maintenance regularly to keep the...
BibTeX reference
In this paper we consider the vehicle routing problem with hard time windows and stochastic service times (VRPTW-ST); in this variant of the classic VRPTW ...
BibTeX reference
This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and last-in-first-out (LIFO) loading constr...
BibTeX reference
This paper studies a districting problem which arises in the context of financial product pricing. The challenge lies in partitioning a set of small geogra...
BibTeX reference
We consider the multicommodity network flow formulation of the Multiple Depot Vehicle Scheduling Problem (MDVSP) and investigate several strategies within a ...
BibTeX reference
In this paper we introduce the discrete time window assignment vehicle routing problem. This problem consists of assigning a single time window from a ...
BibTeX reference
The airline fleet assignment problem (FAP) consists of assigning an aircraft type to each flight leg of a flight schedule in order to maximize the airline ...
BibTeX reference
Dynamic constraint aggregation (DCA) and dual variable stabilization (DVS) are two methods that can reduce the negative impact of degeneracy when solvi...
BibTeX referenceBranch-Price-and-Cut for Creating an Annual Delivery Program of Multi-Product Liquefied Natural Gas
In this paper a new branch-price-and-cut method for a maritime inventory routing problem for one of the world's largest producers of liquefied natural gas (L...
BibTeX reference
In an onshore oil field, the productivity of oil wells decreases when they require maintenance. To restore full productivity at a well, it must be visi...
BibTeX reference
The min-max <i>k</i>-vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle in order to find a set of b...
BibTeX reference
We present a branch-price-and-cut method to solve a maritime pickup and delivery problem with time windows and split loads. The fleet of ships is heterogen...
BibTeX reference
In the service industry, the employees perform work shifts and are assigned to interruptible activities and uninterruptible tasks during their shifts. The ...
BibTeX reference
Le problème d'affectation d'activités et de tâches consiste à affecter des activités interruptibles et des tâches non interruptibles à des quarts de travai...
BibTeX reference