Logistique intelligente (conception d’horaires, chaînes d’approvisionnement, logistique, systèmes manufacturiers)
RetourCahiers du GERAD
793 résultats — page 16 de 40
In the service industry, the employees perform work shifts and are assigned to interruptible activities and uninterruptible tasks during their shifts. The ...
référence BibTeX
We consider a cement delivery problem with an heterogeneous fleet of vehicles and several depots. The demands of the customers are typically larger than the ...
référence BibTeX
The objective in the continuous facility location problem with limited distances is to minimize the sum of distance functions from the facility to the cust...
référence BibTeX
The GRIEG model is a hybrid model of demo-economic projections that combines two approaches: the econometric approach - based on the micro-economy - of the N...
référence BibTeX
Community detection in networks based on modularity maximization is currently done with hierarchical divisive or agglomerative as well as with partitioning h...
référence BibTeX
Heuristics are widely applied to modularity maximization models for the identification of communities in complex networks. We present an approach to be appli...
référence BibTeX
In this paper we study a variant of the Capacitated Team Orienteering Problem (CTOP), that is the problem where a fleet of vehicles, each with a constraint...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
The production-routing problem can be seen as a combination of two well known combinatorial optimization problems: the lotsizing and the vehicle routing prob...
référence BibTeX
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 BibTeX
In the rail industry, profit maximization relies heavily on the integration of logistics activities with an improved management of revenues. The operational ...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
In this paper, we generalize the Asymmetric Representatives Formulation, which was first introduced by Campêlo et al. (2008) for the Node Coloring Problem. ...
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 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...
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