Smart logistics (schedule design, supply chains, logistics, manufacturing systems)
BackCahiers du GERAD
806 results — page 6 of 41
We consider logistic collaborations where multiple carriers collaborate by consolidating demands, combining delivery routes, and serving new customers. Logis...
BibTeX reference
We represent a closed-loop supply chain formed of one manufacturer and one retailer as a dynamic game played over an event tree, which naturally allows to ...
BibTeX reference
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...
BibTeX reference
We study a new variant of the well-studied Vehicle Routing Problem with Time Windows (VRPTW), called the fragility-constrained VRPTW, which assumes that ...
BibTeX referenceVessel service planning in seaports
Berth allocation and pilotage planning are the two most important decisions made by a seaport for serving incoming vessels. Traditionally, the berth allocati...
BibTeX reference
Scholars and practitioners have long recognised the importance of data-driven operations and supply chain management (OSCM), which typically centres on produ...
BibTeX referenceStochastic dual dynamic programming for multi-echelon lot-sizing with component substitution
This work investigates lot-sizing with component substitution under demand uncertainty. The integration of component substitution with lot-sizing in an uncer...
BibTeX reference
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 referenceA branch-price-and-cut algorithm for the two-echelon vehicle routing problem with time windows
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
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
We study a distributionally robust version of the classical capacitated facility location problem with a distributional ambiguity set defined as a Wasserst...
BibTeX reference
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
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
We consider an integrated optimization problem including the production, inventory, and outbound transportation decisions where a central plant fulfills the ...
BibTeX reference
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 referenceA Simulation model for short and long term humanitarian supply chain operations management
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 referenceThe pickup and delivery problem with time windows, multiple stacks, and handling operations
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
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
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