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

Retour

Cahiers du GERAD

784 résultats — page 2 de 40

, et

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

référence BibTeX
, , et

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
et

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

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

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

Benders decomposition has been applied significantly to tackle large-scale optimization problems with complicating variables, which, when temporarily fixed, ...

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

Operations research specialists at the OCP Group, the Mohammed VI Polytechnic University, and the Polytechnique Montreal operationalized a system optimizing ...

référence BibTeX

Perturbations are universal in supply chains, and their appearance is getting more frequent in the past few years. These perturbations affect industries and ...

référence BibTeX
, et

The emerging demand for electric bicycles in recent years has prompted several bike-sharing systems (BSS) around the world to adapt their service to a new wa...

référence BibTeX
, et

The popularity of bike-sharing systems has constantly increased throughout the last years. Most of such success can be attributed to their multiple benefits,...

référence BibTeX
, et

We consider the problem of minimizing the linear cost of multistate homogeneous series-parallel system given the nonlinear reliability constraint on the syst...

référence BibTeX
, et

In this paper, we study the pickup and delivery problem with time windows and multiple compartments (PDPTWMC). The PDPTWMC generalizes the pickup and delive...

référence BibTeX

The Quadratic Knapsack Problem (QKP) is a combinatorial optimization problem that has attracted much attention over the past four decades. In this problem, o...

référence BibTeX

We investigate a facility location problem with modular capacity under demand uncertainty arising at Hydro-Québec, the largest public utility in Canada. We p...

référence BibTeX
, et

This paper introduces the consistent vehicle routing problem with stochastic customers and demands. We consider driver consistency as customer-driver assignm...

référence BibTeX