Smart logistics (schedule design, supply chains, logistics, manufacturing systems)

Back

Cahiers du GERAD

781 results — page 5 of 40

, , , and

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

BibTeX reference

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

BibTeX reference
, , , and

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

BibTeX reference

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

BibTeX reference
, , and

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

BibTeX reference
and

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

BibTeX reference
, , , and

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

BibTeX reference
, , , and

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

BibTeX reference
, , and

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

BibTeX reference
, , and

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

BibTeX reference
and

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

BibTeX reference

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

BibTeX reference
and

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

BibTeX reference
, , , , and

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

BibTeX reference
, , and

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

BibTeX reference
, , and

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

BibTeX reference
and

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

BibTeX reference
, , , and

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

BibTeX reference

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

BibTeX reference
, , and

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

BibTeX reference