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

Retour

Cahiers du GERAD

784 résultats — page 5 de 40

Given a set of predefined duties and groups of drivers, the duty assignment problem with group-based driver preferences (DAPGDP) aims at building rosters tha...

référence BibTeX
, et

We study a new variant of the well-studied Vehicle Routing Problem with Time Windows (VRPTW), called the fragility-constrained VRPTW, which assumes that ...

référence BibTeX
, , et

Berth allocation and pilotage planning are the two most important decisions made by a seaport for serving incoming vessels. Traditionally, the berth allocati...

référence BibTeX
, , et

Scholars and practitioners have long recognised the importance of data-driven operations and supply chain management (OSCM), which typically centres on produ...

référence BibTeX

This work investigates lot-sizing with component substitution under demand uncertainty. The integration of component substitution with lot-sizing in an uncer...

référence BibTeX
, , et

We consider the problem of designing vehicle routes in a distribution system that are at the same time cost-effective and visually attractive. In this pape...

référence BibTeX

In this paper, we propose an exact branch-price-and-cut (BPC) algorithm for the two-echelon vehicle routing problem with time windows. This problem arises i...

référence BibTeX
, et

This paper studies disjunctive cutting planes in Mixed-Integer Conic Programming. Building on conic duality, we formulate a cut-generating conic program for...

référence BibTeX
et

We study a distributionally robust version of the classical capacitated facility location problem with a distributional ambiguity set defined as a Wasserst...

référence BibTeX
, , et

We study a new variant of the vehicle routing problem, which arises in hospital-wide scheduling of physical therapists. Multiple service locations exist for...

référence BibTeX
, , et

Column generation (CG) algorithms are well known to suffer from convergence issues due, mainly, to the degenerate structure of their master problem and the ...

référence BibTeX
, et

We consider an integrated optimization problem including the production, inventory, and outbound transportation decisions where a central plant fulfills the ...

référence BibTeX
, et

Column generation (CG) is widely used for solving large-scale optimization problems. This article presents a new approach based on a machine learning (ML) t...

référence BibTeX
et

Traditionally, the design of supply chains for humanitarian operations has been developed distinctly for the different disaster management phases, with littl...

référence BibTeX

The monthly crew pairing problem (CPP) consists of determining a least-cost set of feasible crew pairings (sequences of flights starting and ending at a crew...

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