Smart logistics (schedule design, supply chains, logistics, manufacturing systems)
BackCahiers du GERAD
806 results — page 17 of 41
We present a new column generation algorithm for the determination of a classifier in the two classes LAD (Logical Analysis of Data) model. Unlike existing a...
BibTeX reference
We study extremal graphs for the extremal values of the second largest <i>Q</i>-eigenvalue of a connected graph. We first characterize all simple connected g...
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
The production-routing problem can be seen as a combination of two well known combinatorial optimization problems: the lotsizing and the vehicle routing prob...
BibTeX reference
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...
BibTeX reference
In the rail industry, profit maximization relies heavily on the integration of logistics activities with an improved management of revenues. The operational ...
BibTeX reference
In this paper we study the capacitated team orienteering problem where split deliveries are allowed. A set of potential customers is given, each associated w...
BibTeX reference
Normalized cut is one of the most popular graph clustering criteria. The main approaches proposed for its resolution are spectral clustering methods (e.g. [1...
BibTeX reference
In this paper, we generalize the Asymmetric Representatives Formulation, which was first introduced by Campêlo et al. (2008) for the Node Coloring Problem. ...
BibTeX referenceIntegrated 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...
BibTeX reference
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...
BibTeX reference
The purpose of this paper is to present and solve a new, important planning problem faced by many shipping companies dealing with the transport of bulk produ...
BibTeX reference
The vehicle routing problem with time windows VRPTW consists of finding least-cost vehicle routes to service given customers exactly once each while satisfyi...
BibTeX reference
Dans cet article, on raconte l'histoire de l'équipe GENCOL et du logiciel d'optimisation du même nom. C'est avant tout le récit d'une collaboration qui se po...
BibTeX reference
Traditionally, the airline crew scheduling problem has been decomposed into a crew pairing and a crew assignment problem that are solved sequentially. The f...
BibTeX reference
La confection de calendriers sportifs dans le milieu scolaire québécois est une tâche complexe à laquelle la Fédération Québécoise du Sport Étudiant (FQSE) d...
BibTeX reference
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 ...
BibTeX reference
We present a new general variable neighborhood search approach for the uncapacitated single allocation <i>p</i>-hub median problem in networks. This NP-hard ...
BibTeX reference
Cet article propose une nouvelle architecture générique pour l'implantation d'un système intelligent de contrôle en temps réel basé sur la simulation dans de...
BibTeX referenceEnhanced 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...
BibTeX reference