Logistique intelligente (conception d’horaires, chaînes d’approvisionnement, logistique, systèmes manufacturiers)
RetourCahiers du GERAD
793 résultats — page 2 de 40
Le Treizième atelier de résolution de problèmes industriels de Montréal, qui eut lieu du 21 au 25 août 2023, fut organisé conjointement par le Centre de re...
référence BibTeX
This paper describes a planning problem faced by a fast-growing petroleum company in West Africa. The problem is a complex variant of the petrol station repl...
référence BibTeX
Efficiently solving a vehicle routing problem (VRP
) in a practical runtime is a critical challenge for delivery management companies. This pa...
The truck loading and inventory routing problems are the two most important decisions made by companies replenishing petrol stations. This paper investigates...
référence BibTeX
Bus scheduling in public transit consists in determining a set of bus schedules to cover a set of timetabled trips at minimum cost. This planning process has...
référence BibTeX
Yield uncertainty is an important issue in various industries such as agriculture, food, and textile where the production output is reliant on uncontrollable...
référence BibTeXAlgorithme primal ajoutant des variables pour le problème du partitionnement d'ensemble généralisé
Le problème du partitionnement d'ensemble est un problème de programmation en nombres entiers très étudié. Le problème consiste à trouver une partition de tâ...
référence BibTeX
Inventory management for slow-moving items is challenging due to their high intermittence and lumpiness. Recent developments in machine learning and computat...
référence BibTeXThe heterogeneous-fleet electric vehicle routing problem with nonlinear charging functions
This paper introduces the Heterogeneous-Fleet Electric Vehicle Routing Problem with Nonlinear Charging Functions (HEVRP-NL). This problem involves routing a ...
référence BibTeX
Le problème des décisions optimales de réapprovisionnement des stocks vise à équilibrer les coûts des stocks excédentaires et les risques de pénurie. Dans la...
référence BibTeX
Monte Carlo (MC) is widely used for the simulation of discrete time Markov chains. We consider the case of a d
-dimensional continuous state space and w...
Randomized Quasi-Monte Carlo (RQMC) methods provide unbiased estimators whose variance often converges at a faster rate than standard Monte Carlo as a functi...
référence BibTeX
This study addresses large-scale personnel scheduling problems in the service industry by combining mathematical programming with data mining techniques to...
référence BibTeX
We consider the set of graphs that can be constructed from a one-vertex graph by repeatedly adding a clique or a stable set linked to all or none of the vert...
référence BibTeX
The Network Design Problem with Vulnerability Constraints and Probabilistic Edge Reliability (NDPVC-PER) is an extension of the NDPVC obtained by additionall...
référence BibTeX
In this paper, we describe a branch-and-price algorithm for the personalized nurse scheduling problem. The variants that appear in the literature involve a ...
référence BibTeX
Station-based Bike-sharing systems have been implemented in multiple major cities, offering a low-cost and environmentally friendly transportation alternativ...
référence BibTeX
We study the integration of multi-period assignment, routing, and scheduling of care workers for home health care services. In such a context, it is importa...
référence BibTeX
Two-stage stochastic programs are a class of stochastic problems where uncertainty is discretized into scenarios, making them amenable to solution approaches...
référence BibTeX
This paper investigates a variant of the traveling salesman problem (TSP) with speed optimization for a plug-in hybrid electric vehicle (PHEV), simultaneousl...
référence BibTeX