Smart logistics (schedule design, supply chains, logistics, manufacturing systems)
BackCahiers du GERAD
793 results — page 2 of 40
The Thirteenth Montreal IPSW took place on August 21-25, 2023, and was jointly organized by the Centre de recherches mathématiques (CRM) and the Institute ...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
Yield uncertainty is an important issue in various industries such as agriculture, food, and textile where the production output is reliant on uncontrollable...
BibTeX referenceAlgorithme 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â...
BibTeX reference
Inventory management for slow-moving items is challenging due to their high intermittence and lumpiness. Recent developments in machine learning and computat...
BibTeX referenceThe 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 ...
BibTeX reference
Determining optimal inventory replenishment decisions requires balancing the costs of excess inventory with shortage risks. While demand uncertainty has been...
BibTeX reference
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...
BibTeX reference
This study addresses large-scale personnel scheduling problems in the service industry by combining mathematical programming with data mining techniques to...
BibTeX reference
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...
BibTeX reference
The Network Design Problem with Vulnerability Constraints and Probabilistic Edge Reliability (NDPVC-PER) is an extension of the NDPVC obtained by additionall...
BibTeX reference
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 ...
BibTeX reference
Station-based Bike-sharing systems have been implemented in multiple major cities, offering a low-cost and environmentally friendly transportation alternativ...
BibTeX reference
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...
BibTeX reference
Two-stage stochastic programs are a class of stochastic problems where uncertainty is discretized into scenarios, making them amenable to solution approaches...
BibTeX reference
This paper investigates a variant of the traveling salesman problem (TSP) with speed optimization for a plug-in hybrid electric vehicle (PHEV), simultaneousl...
BibTeX reference