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

Retour

Cahiers du GERAD

806 résultats — page 1 de 41

, , et

This paper investigates the Collaborative Routing Orchestration for Organic Food Distribution Problem (CRO-FDP), a two-echelon collaborative distribution n...

référence BibTeX
, et

In this paper, we study the pickup and delivery problem with time windows, multiple compartments, incompatibility constraints and cleaning operations (PDPTWM...

référence BibTeX
, et

Nous examinons les décisions d'investissement et de tarification en matière de réduction des émissions au sein d'une chaîne d'approvisionnement où les consom...

référence BibTeX
, et

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

Many combinatorial optimization problems, such as vehicle and crew scheduling, can be modeled using path-flow formulations, where each variable represents a ...

référence BibTeX

Cet article présente une nouvelle variante du problème de production et de distribution intégré dans une chaîne d'approvisionnement à deux niveaux impliquant...

référence BibTeX

Rolling stock scheduling and crew scheduling are two fundamental problems that arise in the planning of urban rail operations and that are especially importa...

référence BibTeX
, et

A shift toward shopping at (autonomous) wheeled vending stores is redefining urban retail. Compared with traditional brick-and-mortar stores, such mobile sto...

référence BibTeX

This study investigates multi-store order delivery services where customers can order from multiple stores for home delivery. We first consider separated-ord...

référence BibTeX

Ultra-fast delivery revolutionizes food and grocery services, with several companies advertising delivery times under 15 to 30 minutes. Motivated by the mult...

référence BibTeX

For continuing tasks, average cost Markov decision processes have well- documented value and can be solved using efficient algorithms. However, it explici...

référence BibTeX

Researchers around the globe attend the International Symposium on Mathematical Programming (ISMP) to share their latest results in mathematics, algorithms, ...

référence BibTeX

We consider fair resource allocation in sequential decision-making environments modeled as weakly coupled Markov decision processes, where resource constrain...

référence BibTeX
, et

The \(p\)-median problem is a classical location problem where the goal is to select \(p\) facilities while minimizing the sum of distances from each loc...

référence BibTeX

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

référence BibTeX

The crew rostering problem (CRP) for pilots is a complex crew scheduling task assigning pairings, or sequences of flights starting and ending at the same air...

référence BibTeX
, et

This paper addresses the problem of efficiently routing vehicles for spring sweeping operations in countries that spread sand and gravel on roads in winter. ...

référence BibTeX
, et

Motivés par notre collaboration avec une plateforme en ligne opérant en Amérique du Nord, nous explorons l'optimisation conjointe du processus d'exécution de...

référence BibTeX
, et

We investigate the impact of information asymmetry regarding the producer of remanufactured products on the decisions of a manufacturer and an authorized r...

référence BibTeX