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

Retour

Cahiers du GERAD

729 résultats — page 3 de 37

et

In this paper, we introduce, model and solve the pickup and delivery problem with time windows, multiple stacks, and handling operations (PDPTWMS-H). % In...

référence BibTeX
, , , et

It is well known that the integrated optimization of multiple and inter-related decisions in a supply chain can bring important benefits to companies. In thi...

référence BibTeX
, et

The crew pairing problem is generally modelled as a set partitioning problem where the flights have to be partitioned in pairings. A pairing is a sequence of...

référence BibTeX
, et

In this paper we study the spectral properties of the threshold graphs. In particular, we give lower and upper bounds for the largest and smallest eigenvalue...

référence BibTeX
et

The energy of a graph \(G\), denoted by \({\cal E}(G)\), is defined as the sum of the absolute values of all eigenvalues of \(G\). In this paper we stu...

référence BibTeX
, , et

Column generation algorithms for solving vehicle routing problems often rely on a relaxed pricing subproblem where routes may be non-elementary and which is ...

référence BibTeX

Mineral value chains or mining complexes involve mining, processing, stockpiling, waste management, and transportation activities. An integrated stochastic...

référence BibTeX

The standard blending problem consists of combining components to produce a final product with a given demand, while satisfying specific criteria with resp...

référence BibTeX
, et

We address the problem of accelerating column generation (CG) for set-covering formulations via dual optimal inequalities (DOI). DOI use knowledge of the du...

référence BibTeX

The integral column generation algorithm (ICG) was recently introduced to solve set partitioning problems involving a very large number of variables. This pr...

référence BibTeX

In derivative-free and blackbox optimization, the objective function is often evaluated through the execution of a computer program seen as a blackbox. It ...

référence BibTeX
, , et

Production planners in the non-ferrous metal industry face an inherent combinatorial complexity of the metal production process within a fast changing market...

référence BibTeX
, , , et

This paper studies the team orienteering problem, where the arrival time and service time affect the collection of profits. Such interactions result in a non...

référence BibTeX
, et

We propose a generalized decomposition approach for production planning problems with process configuration decisions. These problems appear in contexts wher...

référence BibTeX

Dealing with demand uncertainty in multi-item lot sizing problems poses huge challenges due to the inherent complexity. The resulting stochastic formulation...

référence BibTeX
, et

Nous déterminons le prix optimal et la quantité commandée de deux produits substituts offerts dans deux marchés, dont l'un est saisonnier avec un potentiel d...

référence BibTeX
, , , 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
, et

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