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

Retour

Cahiers du GERAD

773 résultats — page 6 de 39

, , , et

Cities are facing severe traffic-related problems causing emission thresholds to be exceeded. All around the world, city center access restriction policies a...

référence BibTeX
, , , et

In e-commerce warehouses, online retailers increase their efficiency by using a mixed-shelves (or scattered storage) concept, where unit loads are purposeful...

référence BibTeX

We introduce the conditional \(p\)-dispersion problem (c-pDP), an incremental variant of the \(p\)-dispersion problem (pDP). In the c-pDP, one is given a...

référence BibTeX

Nous étudions un problème stochastique de planification de production et réapprovision-nement sur trois échelons via un processus de décision en deux étapes....

référence BibTeX

Personnel scheduling consists of determining least-cost work schedules to cover the demand of multiple jobs expressed in number of employees per job and peri...

référence BibTeX
, et

Variable fixing by reduced costs is a popular technique for accelerating the solution process of mixed-integer linear programs. For vehicle routing problems ...

référence BibTeX
, , et

User-centered logistics aiming at customer satisfaction are gaining importance due to growing e-commerce and home deliveries. Customer satisfaction can be ...

référence BibTeX
, , et

This paper studies the Dynamic Facility Location Problem with Modular Capacities (DFLPM). We propose a linear relaxation based heuristic (LRH) and an evoluti...

référence BibTeX

In large commercial airlines, the monthly schedule (roster) of the crew members is usually determined by solving two problems sequentially, namely, the crew ...

référence BibTeX
, et

We present a case study of using machine learning classification algorithms to initialize a large scale commercial operations research solver (GENCOL) in the...

référence BibTeX
, , et

In the Inventory Routing Problem customer demand is satisfied from inventory which is replenished with capacitated vehicles. The objective is to minimize tot...

référence BibTeX

Given a set of duties to be operated over a cyclic one-week horizon and groups of drivers with similar characteristics, the cyclic bus driver rostering probl...

référence BibTeX
, , et

We consider a personalized employee scheduling problem with characteristics present in retail stores consisting of multiple departments. In the setting under...

référence BibTeX
, et

This paper develops an exact method for the redundancy allocation problem (RAP) for multistate homogeneous series-parallel systems. The problem aims to min...

référence BibTeX

The Integral Simplex Using Decomposition (ISUD) algorithm has been developed recently to solve large set partitioning problems (SPPs) in a primal way, i.e.,...

référence BibTeX
, et

Facility networks can be disrupted by, for example, power outages, poor weather conditions, or natural disasters, and the probabilities of these events may b...

référence BibTeX
, et

In this paper, we develop algorithmic approaches for a recently defined class of games, the integer programming games. Two general methods to approximate an...

référence BibTeX
et

Dans cet article, nous étudions le problème du partage de responsabilités dans la récupération de produits usés et son lien avec la conception d’une réglemen...

référence BibTeX
, , , et

We study an integrated process configuration, lot-sizing, and scheduling problem, which appears in a real production environment in the packaging industry. P...

référence BibTeX

This paper addresses combinatorial optimization problems under uncertain and correlated data where the mean-covariance information of the random data is assu...

référence BibTeX