Smart logistics (schedule design, supply chains, logistics, manufacturing systems)
BackCahiers du GERAD
784 results — page 1 of 40
This paper addresses the Integrated Electrical Drill Rig Dispatching and Drilling Coordination Problem (IDRDCP) in open-pit mining operations, combining mach...
BibTeX reference
The routing-and-driving problem for plug-in hybrid electric vehicles (PHEVs) is an extension of the vehicle routing problem with time windows, where routing ...
BibTeX reference
This study explores accelerating strategies in column generation (CG) to effectively solve online dial-a-ride problems in large-scale ride-sharing systems. ...
BibTeX reference
This paper presents a partial outsourcing strategy for the vehicle routing problem with stochastic demands (VRPSD), and routing reoptimization is considered ...
BibTeX referenceBranch-and-Price
Integer (linear) programs are a standard way of formalizing a vast array of optimization problems in industry, services, management, science, and technology....
BibTeX referenceTight upper and lower bounds for the quadratic knapsack problem through binary decision diagram
The Quadratic Knapsack Problem (QKP) is a challenging combinatorial optimization problem that has attracted significant attention due to its complexity and p...
BibTeX reference
Designing efficient evacuation networks is crucial for disaster preparedness, as poorly planned and managed evacuations can increase the time required for ev...
BibTeX reference
The cubic knapsack problem (CKP) is a combinatorial optimization problem, which can be seen both as a generalization of the quadratic knapsack problem (QKP) ...
BibTeX reference
Local search methods start from a feasible solution and improve it by successive minor modifications until a solution that cannot be further improved is enco...
BibTeX reference
This paper tackles a complex variant of the unit commitment (UC) problem at Hydro-Quebec, referred to as the transient stability constrained unit commitmen...
BibTeX reference
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 (\(\mathcal{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