Logistique intelligente (conception d’horaires, chaînes d’approvisionnement, logistique, systèmes manufacturiers)

Retour

Cahiers du GERAD

806 résultats — page 2 de 41

Blending problems occur when different components are mixed to form an end product. The recipe typically has some flexibility as long as specific quality con...

référence BibTeX
, , et

The procurement of freight services is an important element for the supply chain management of a shipper (i.e., a manufacturer or retailer) that sources tran...

référence BibTeX

In the multi-commodity two-echelon vehicle routing problem with time windows (MC-2E-VRPTW), first-echelon vehicles transport goods from depots to satellites...

référence BibTeX
, et

Planners in different industries use optimization software for decision-making. In numerous practical applications, these optimization tools are often not re...

référence BibTeX

Le Quatorzième atelier de résolution de problèmes industriels de Montréal, qui eut lieu du 13 au 17 mai 2024, fut organisé conjointement par le Centre de rec...

référence BibTeX
, , et

Cet article traite du problème intégré d'affectation et de coordination des foreuses électri-ques dans les mines à ciel ouvert, combinant l'attribution des m...

référence BibTeX

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 ...

référence BibTeX

Cette étude explore les stratégies d'accélération de la génération de colonnes (CG) afin de résoudre efficacement les problèmes de demandes de transport en l...

référence BibTeX
, et

This paper presents a partial outsourcing strategy for the vehicle routing problem with stochastic demands (VRPSD), and routing reoptimization is considered ...

référence BibTeX
, , et

Integer (linear) programs are a standard way of formalizing a vast array of optimization problems in industry, services, management, science, and technology....

référence BibTeX

The Quadratic Knapsack Problem (QKP) is a challenging combinatorial optimization problem that has attracted significant attention due to its complexity and p...

référence BibTeX
, , et

Designing efficient evacuation networks is crucial for disaster preparedness, as poorly planned and managed evacuations can increase the time required for ev...

référence BibTeX

The cubic knapsack problem (CKP) is a combinatorial optimization problem, which can be seen both as a generalization of the quadratic knapsack problem (QKP) ...

référence BibTeX
, , , , , et

This paper tackles a complex variant of the unit commitment (UC) problem at Hydro-Quebec, referred to as the transient stability constrained unit commitmen...

référence BibTeX
, , , , , , , , , , , , et

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
, , et

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 (\(\mathcal{VRP}\)) in a practical runtime is a critical challenge for delivery management companies. This pa...

référence BibTeX
, , et

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
, et

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
, , et

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 BibTeX